×

A class of data-center network models offering symmetry, scalability, and reliability. (English) Zbl 1284.68055

Summary: We propose a symmetrical scheme, by drawing results from group theory, and use it to build a new class of data center network models. The results are superior to current network models with respect to a number of performance criteria. Greater symmetry in networks is important, as it leads to simpler structure and more efficient communication algorithms. It also tends to produce better scalability and greater fault tolerance. Our models are general and are expected to find many applications, but they are particularly suitable for large-scale data-center networks.

MSC:

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

References:

[1] Ghemawat S., Operating Systems Principles 2003 pp 29–
[2] Dean J., Implementation 2004 pp 137–
[3] Isard M., Proc. ACM European Conference on Computer Systems 2007 pp 59–
[4] Al-Fares M., Data Communication 2008 pp 63–
[5] Guo C., Data Communication 2008 pp 75–
[6] Guo C., Data Communication 2009 pp 63–
[7] Li D., Proc. INFOCOM 2009 pp 2276–
[8] Alspach B., New York 200 pp 156–
[9] Xaio W., J. Comput. Math. 82 pp 521– (2005)
[10] DOI: 10.1016/j.disc.2008.11.030 · Zbl 1206.05050 · doi:10.1016/j.disc.2008.11.030
[11] Xiao W., J. Comput. Math. 88 pp 2669– (2011)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.