Constructing dual-CISTs of DCell data center networks
From MaRDI portal
Publication:2286061
DOI10.1016/j.amc.2019.06.060zbMath1433.68308WikidataQ127556902 ScholiaQ127556902MaRDI QIDQ2286061
Jou-Ming Chang, Xiao-Wen Qin, Rong-xia Hao
Publication date: 9 January 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.06.060
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Constructing tri-CISTs in shuffle-cubes, Constructing tri-CISTs in shuffle-cubes, Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes, Three completely independent spanning trees of crossed cubes with application to secure-protection routing, Constructing dual-CISTs of folded divide-and-swap cubes, The vertex-pancyclicity of data center networks, Reliability analysis based on the dual-CIST in shuffle-cubes, Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
Cites Work
- The restricted \(h\)-connectivity of the data center network DCell
- Constructing two completely independent spanning trees in hypercube-variant networks
- Ore's condition for completely independent spanning trees
- Two counterexamples on completely independent spanning trees
- Constructing completely independent spanning trees in crossed cubes
- Completely independent spanning trees in some regular graphs
- An efficient algorithm to construct disjoint path covers of DCell networks
- Conditional edge-fault-tolerant Hamiltonicity of the data center network
- The pessimistic diagnosability of data center networks
- Completely independent spanning trees in (partial) \(k\)-trees
- Degree condition for completely independent spanning trees
- Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
- Dirac's Condition for Completely Independent Spanning Trees
- Completely independent spanning trees in torus networks
- Completely independent spanning trees in the underlying graph of a line digraph
- Unnamed Item
