An efficient algorithm to construct disjoint path covers of DCell networks

DOI10.1016/J.TCS.2015.09.022MaRDI QIDQ897875zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

Hamiltonian pathDCell networkdisjoint path coverdata center network

Mathematics Subject Classification ID

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)

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
• Publication:4321476

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A quadratic algorithm for finding next-to-shortest paths in graphs
• AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• An oblivious shortest-path routing algorithm for fully connected cubic networks
• Efficient unicast in bijective connection networks with the restricted faulty node set
• On mapping processes to processors in distributed systems
• On structured digraphs and program testing
• 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
• Optimal broadcasting for locally twisted cubes
• Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model
• The NP-completeness column: An ongoing gulde
• Two spanning disjoint paths with required length in generalized hypercubes

Cited in

(18)

• An efficient shortest-path routing algorithm in the data centre network DPillar
• Super spanning connectivity on WK-recursive networks
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Two-disjoint-cycle-cover pancyclicity of data center networks
• The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
• Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• On the combinatorial design of data centre network topologies
• Constructing dual-CISTs of folded divide-and-swap cubes
• On the mathematics of data centre network topologies
• Torus-like graphs and their paired many-to-many disjoint path covers
• Enhancing fault tolerance of balanced hypercube networks by the edge partition method
• Reliability analysis of data center networks based on precise and imprecise diagnosis strategies
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Constructing dual-CISTs of DCell data center networks
• The disjoint path cover in the data center network HSDC with prescribed vertices in each path

Describes a project that uses

Uses Software

• MapReduce
• Dryad

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)