An efficient algorithm to construct disjoint path covers of DCell networks
DOI10.1016/J.TCS.2015.09.022zbMATH Open1331.68159OpenAlexW2172760123WikidataQ60402100 ScholiaQ60402100MaRDI QIDQ897875FDOQ897875
Authors: Xi Wang, Jianxi Fan, Cheng-Kuan Lin, X.-H. Jia 
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.022
Recommendations
- The restricted \(h\)-connectivity of the data center network DCell
- Constructing dual-CISTs of DCell data center networks
- On the combinatorial design of data centre network topologies
- An efficient shortest-path routing algorithm in the data centre network DPillar
- scientific article; zbMATH DE number 714464
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Efficient unicast in bijective connection networks with the restricted faulty node set
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
- One-to-one disjoint path covers on alternating group graphs
- One-to-one disjoint path covers on multi-dimensional tori
- On mapping processes to processors in distributed systems
- Optimal broadcasting for locally twisted cubes
- Two spanning disjoint paths with required length in generalized hypercubes
- Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model
- An oblivious shortest-path routing algorithm for fully connected cubic networks
- A quadratic algorithm for finding next-to-shortest paths in graphs
- On structured digraphs and program testing
- The NP-completeness column: An ongoing gulde
- AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS
Cited In (17)
- Enhancing fault tolerance of balanced hypercube networks by the edge partition method
- Two-disjoint-cycle-cover pancyclicity of data center networks
- On the mathematics of data centre network topologies
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
- An improved algorithm to construct edge-independent spanning trees in augmented cubes
- On the combinatorial design of data centre network topologies
- Disjoint path covers with path length constraints in restricted hypercube-like graphs
- Constructing dual-CISTs of DCell data center networks
- Constructing dual-CISTs of folded divide-and-swap cubes
- Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
- Reliability analysis of data center networks based on precise and imprecise diagnosis strategies
- Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
- Super spanning connectivity on WK-recursive networks
- An efficient shortest-path routing algorithm in the data centre network DPillar
- Torus-like graphs and their paired many-to-many disjoint path covers
- Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
Uses Software
This page was built for publication: An efficient algorithm to construct disjoint path covers of DCell networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897875)
