Paper Title : The Summary of Fault Tolerant Hamiltonian Properties of Data Center Network
ISSN : 2394-2231
Year of Publication : 2020
MLA Style: Shuai Ding, ZhiyuZhao " The Summary of Fault Tolerant Hamiltonian Properties of Data Center Network " Volume 7 - Issue 6 November - December,2020 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org
APA Style: Shuai Ding, ZhiyuZhao " The Summary of Fault Tolerant Hamiltonian Properties of Data Center Network " Volume 7 - Issue 6 November - December,2020 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org
As the infrastructure of cloud computing, the research of data center network has been the focus in recent years.The data center network is undergoing profound changes, and a large number of highperformance network topology has been proposed. The Hamiltonian Properties of the network has a wide range of applications. Then the use of Hamiltonian circles or Hamiltonian paths on the data center network can effectively reduce or avoid deadlock and congestion. At the same tine, since server or link failures are unavoidable in the network, it is meaningful to study the fault-tolerant Hamiltonian properties. In this paper, First of all, the network structure of the cloud computing data center is discussed from two categories: switch-centric networks and server-centric networks. In addition, the network structure with fault-tolerant Hamiltonian properties is studied, and finally the general method of analyzing fault-tolerant Hamiltonian properties based on structure induction is summarized.
 Shafer J, Rixner S, Cox A L. Datacenter storage architecture for mapreduce applications[C]//ACLD: Workshop on Architectural Concerns in Large Datacenters. 2009, 131.  Wittmann, Art. What Cloud Computing Really Means.[J]. Informationweek, 2010  Alfares M, Loukissas A, Vahdat A, et al. A scalable, commodity data center network architecture[C]. acm special interest group on data communication, 2008, 38(4): 63-74.  Greenberg A , Hamilton J R , Jain N , et al. VL2: A Scalable and Flexible Data Center Network[J]. Communications of the ACM, 2009, 54(3):95-104.  C. Guo, H. Wu, K. Tan, L. Shi, Y. Zhang, and S. Lu, “DCell: A scalable and fault-tolerant network structure for data centers,” in Proc. ACM SIGCOMM Conf. Data Commun., Aug. 2008, pp. 75–86.  C. Guo, et al., “BCube: A high performance, server-centric network architecture for modular data centers,” in Proc. ACM SIGCOMM Conf. Data Commun., Aug. 2009, pp. 63–74.  Li D , Guo C , Wu H , et al. FiConn: Using Backup Port for Server Interconnection in Data Centers[C]// INFOCOM 2009, IEEE. IEEE, 2009.  Guo D, Chen T, Li D, et al. Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers[J]. IEEE Transactions on Computers, 2013, 62(7): 1303-1317.  Xiaowen Qin. The fault-tolerant Hamiltonicity of some kinds of networks [D]. Beijing Jiaotong University, 2018.  Wang X, Erickson A, Fan J, et al. Hamiltonian Properties of DCell Networks[J]. The Computer Journal, 2015, 58(11): 2944-2955.  Bhuyan, Agrawal. Generalized Hypercube and Hyperbus Structures for a Computer Network[J]. IEEE Transactions on Computers, 1984, 33(4): 323-333.  Abulibdeh H, Costa P, Rowstron A, et al. Symbiotic routing in future data centers[C]. acm special interest group on data communication, 2010, 40(4): 51-62.  Dally W J. Performance analysis of k-ary n-cube interconnection networks[J]. IEEE Transactions on Computers, 1990, 39(6): 775-785.  Tsai C, Tan J J, Liang T, et al. Fault-tolerant hamiltonian laceability of hypercubes[J]. Information Processing Letters, 2002, 83(6): 301-306.  Huang W T, Chuang Y C, Tan J J, et al. On the fault-tolerant hamiltonicity of fault crossed cubes [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2002, 85(6): 1359-1370.  Zhe Zhang. Fault-Tolerance Research of Locally Twisted Cubes and Möbius cubes [D]. Dalian University, 2017.  Wang S, Zhang S, Yang Y, et al. Hamiltonian path embeddings in conditional faulty k-ary n-cubes[J]. Information Sciences, 2014: 463-488.  Zhang S, Zhang X. Fault-Free Hamiltonian Cycles Passing through Prescribed Edges in k -Ary n-cubes with Faulty Edges[J]. IEEE Transactions on Parallel and Distributed Systems, 2015, 26(2): 434-443.  Lv Y, Lin C, Fan J, et al. Hamiltonian Cycle and Path Embeddings in k-Ary n-Cubes Based on Structure Faults[J]. The Computer Journal, 2016, 60(2): 159-179.  Yinhe Huangfu. Hamiltonian Analysis of Network Structure Based on Basic Elements [D]. Henan University, 2019.
Computing, Data Center Network, Fault Tolerant Hamiltonian Properties