Conditional edge-fault-tolerant Hamiltonicity of the data center network

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 con...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2018-10, Vol.247, p.165-179
Main Authors: Qin, Xiao-Wen, Hao, Rong-Xia
Format: Article
Language:English
Subjects:
Computer centers
Conditional edge-fault-tolerance
Data center networks
Data centers
Dimensional tolerances
Fault tolerance
Faulty tolerance
Hamiltonian cycle
Switches
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2018.03.049