Paper Info
Title
Conditional edge-fault-tolerant Hamiltonicity of the data center network.
Abstract
The k-dimensional data center network with n port switches, denoted by Dk,n, has been proposed for data centers as a server centric network structure. Wang et al. (2015) had shown that Dk,n is (n+k−3)-fault-tolerant Hamiltonian. In this paper, we consider more faulty edges and prove that Dk,n is conditional (2n+2k−9)-edge-fault-tolerant Hamiltonian for any k≥0 and n≥2 except k=1 and n≥6. Moreover, the upper bound 2n+2k−9 of |F| is optimal.
Year
DOI
Venue
2018
10.1016/j.dam.2018.03.049
Discrete Applied Mathematics
Keywords
Field
DocType
Data center networks,Hamiltonian cycle,Faulty tolerance,Conditional edge-fault-tolerance
Discrete mathematics,Combinatorics,Hamiltonian (quantum mechanics),Upper and lower bounds,Fault tolerance,Data center,Mathematics,Network structure
Journal
Volume
ISSN
Citations 
247
0166-218X
0
PageRank 
References 
Authors
0.34
16
2
Name
Order
Citations
PageRank
Xiao-Wen Qin142.40
Rongxia Hao216526.11