A CLASS OF DATA-CENTER NETWORK MODELS OFFERING SYMMETRY, SCALABILITY, AND RELIABILITY

DOI10.1142/S0129626412500132MaRDI QIDQ5408356zbMATH OpenOpenAlexFDO

Authors Wenjun Xiao, Huomin Liang, Behrooz Parhami

Publication date 10 April 2014

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129626412500132

zbMATH Keywords

routing algorithmnetwork performancestructural symmetrynetwork costdata-center network model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Recommendations

• The generalized connectivity of data center networks
• Reliable Multicast in Data Center Networks
• On the combinatorial design of data centre network topologies
• The vertex-pancyclicity of data center networks
• Structure connectivity of data center networks
• On the mathematics of data centre network topologies

Cites work

• Cayley graphs as classifiers for data mining: the influence of asymmetries

Cited in

(2)

• Data center interconnection networks are not hyperbolic
• Data center networking. Network topologies and traffic management in large-scale data centers

This page was built for publication: A CLASS OF DATA-CENTER NETWORK MODELS OFFERING SYMMETRY, SCALABILITY, AND RELIABILITY

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408356)