Abstract
In large-scale data centers, many servers are interconnected via a dedicated network topology to satisfy specific design goals, such as the low equipment cost, the high network capacity, and the incremental expansion. The topological properties are critical factors that dominate the performance of the entire data center. The existing network topologies are either fully random or completely structured. Although such topologies exhibit advantages in given aspects, they suffer obvious shortcomings in other essential fields. In this chapter, we describe a general topology design methodology for data centers via the compound graph theory. We further propose a hybrid topology, called R3, which is the compound graph of a structured topology and a random topology. More precisely, R3 employs a random regular graph as a unit cluster and connects many such clusters by means of the generalized hypercube. R3 combines the advantages of the random regular graph and generalized hypercube, while effectively avoiding the shortcomings of the above two topologies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Al-Fares M, Loukissas A, Vahdat A. A scalable, commodity data center network architecture [J]. ACM SIGCOMM Computer Communication Review, 2008, 38(4): 63–74.
Greenberg A, Hamilton J R, Jain N, et al. VL2: a scalable and flexible data center network [J]. ACM SIGCOMM computer communication review. ACM, 2009, 39(4): 51–62.
Guo D, Chen T, Li D, et al. Expandable and cost-effective network structures for data centers using dual-port servers [J]. Computers, IEEE Transactions on, 2013, 62(7): 1303–1317.
Shin J Y, Wong B, Sirer E G. Small-world datacenters [C]. In Proc. of 2nd ACM SOCC, Cascais, Portugal, 2011: 1–13.
Singla A, Hong C Y, Popa L, et al. Jellyfish: Networking Data Centers Randomly [C]. In Proc. of 9th USENIX NSDI, Boston, USA, 2011: 17–17.
Gyarmati L, Trinh T A. Scafida: A scale-free network inspired data center architecture [J]. ACM SIGCOMM Computer Communication Review, 2010, 40(5): 4–12.
Bollobs, B. Random Graphs[M]. Cambridge: Cambridge University Press, 2001.
Xie J, Guo D, Xu J, et al. Efficient Multicast Routing on BCube-Based Data Centers [J]. KSII Transactions on Internet and Information Systems (TIIS), 2014, 8(12): 4343–4355.
Bondy J A, Murty U S R. Graph theory with applications [M]. London: Macmillan, 1976.
Brlaz D. New methods to color the vertices of a graph [J]. Communications of the ACM, 1979, 22(4): 251–256.
Aljazzar H, Leue S. K*: A heuristic search algorithm for finding the k shortest paths [J]. Artificial Intelligence, 2011, 175(18): 2129–2154.
Giannini E, Botta F, Borro P, et al. Platelet count/spleen diameter ratio: proposal and validation of a non-invasive parameter to predict the presence of oesophageal varices in patients with liver cirrhosis [J]. Gut, 2003, 52(8): 1200–1205.
Bhuyan L N, Agrawal D P. Generalized hypercube and hyperbus structures for a computer network [J]. Computers, IEEE Transactions on, 1984, 100(4): 323–333.
Guo J, Liu F, Zeng D, et al. A cooperative game based allocation for sharing data center networks [C]. In Proc. of IEEE INFOCOM, Turin, Italy, 2013: 2139–2147.
Guo J, Liu F, Huang X, et al. On efficient bandwidth allocation for traffic variability in datacenters [C]. In Proc. of IEEE INFOCOM, Toronto, Canada, 2014: 1572–1580.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2022 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Guo, D. (2022). R3: A Hybrid Network Topology for Data Centers. In: Data Center Networking. Springer, Singapore. https://doi.org/10.1007/978-981-16-9368-7_5
Download citation
DOI: https://doi.org/10.1007/978-981-16-9368-7_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-9367-0
Online ISBN: 978-981-16-9368-7
eBook Packages: Computer ScienceComputer Science (R0)