The restricted \(h\)-connectivity of the data center network DCell

DOI10.1016/j.dam.2015.09.002zbMath1332.05133OpenAlexW1860999107MaRDI QIDQ260051

Jingya Zhou, Jianxi Fan, Cheng-Kuan Lin, Xi Wang

Publication date: 18 March 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.09.002

zbMATH Keywords

connectivityfault-toleranceDCell networkDCNrestricted connectivity

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (25)

On the conjecture of vertex-transitivity of DCell ⋮ Conditional edge-fault-tolerant Hamiltonicity of the data center network ⋮ Fractional Matching Preclusion for Data Center Networks ⋮ Fractional Matching Preclusion for Data Center Networks ⋮ The Generalized Connectivity of Data Center Networks ⋮ Fault diagnosability of data center networks ⋮ On k-restricted connectivity of direct product of graphs ⋮ \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model ⋮ Reliability evaluation of complete graph-based recursive networks ⋮ Structure connectivity of data center networks ⋮ The fault tolerance of \(( n , k )\)-bubble-sort networks ⋮ A note on the strong matching preclusion problem for data center networks ⋮ Component connectivity of the data center network dcell ⋮ The pessimistic diagnosability of data center networks ⋮ The \(h\)-restricted connectivity of the generalized hypercubes ⋮ The vertex-pancyclicity of data center networks ⋮ The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell ⋮ The \(h\)-restricted connectivity of balanced hypercubes ⋮ A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices ⋮ The \(k\)-restricted edge-connectivity of the data center network DCell ⋮ The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model ⋮ Constructing dual-CISTs of DCell data center networks ⋮ Reliability analysis of data center networks based on precise and imprecise diagnosis strategies ⋮ Strongly Menger connectedness of data center network and \((n,k)\)-star graph ⋮ Structure fault tolerance of WK-recursive networks

Cites Work

• Unnamed Item
• Fault-tolerance of \((n, k)\)-star networks
• One-to-one communication in twisted cubes under restricted connectivity
• Edge fault tolerance of graphs with respect to super edge connectivity
• A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
• 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
• A kind of conditional vertex connectivity of star graphs
• A kind of conditional fault tolerance of alternating group graphs
• Conditional connectivity of Cayley graphs generated by transposition trees
• The \(k\)-restricted edge-connectivity of a product of graphs
• Conditional fault tolerance of arrangement graphs
• Edge fault tolerance analysis of a class of interconnection networks
• Generalized measures of fault tolerance in exchanged hypercubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Conditional connectivity
• Fault Tolerance on Star Graphs
• Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
• Generalized measures for fault tolerance of star networks

This page was built for publication: The restricted \(h\)-connectivity of the data center network DCell