Lascada: A novel scalable topology for data center network
Author | Chkirbene, Zina |
Author | Hadjidj, Rachid |
Author | Foufou, Sebti |
Author | Hamila, Ridha |
Available date | 2023-04-04T09:09:07Z |
Publication Date | 2020 |
Publication Name | IEEE/ACM Transactions on Networking |
Resource | Scopus |
Abstract | The growth of cloud-based services is mainly supported by the core networking infrastructures of large-scale data centers, while the scalability of these services is influenced by the performance and dependability characteristics of data centers. Hence, the data center network must be agile and reconfigurable in order to respond quickly to the ever-changing application demands and service requirements. The network must also be able to interconnect the big number of nodes, and provide an efficient and fault-tolerant routing service to upper-layer applications. In response to these challenges, the research community began exploring novel interconnect topologies, namely: Flecube, DCell, Ficonn, HyperFlaNet and BCube. However, these topologies either scale too fast (grows exponentially in size), or too slow, and therefore suffer from performance bottlenecks. In this paper, we propose a novel data center topology called LaScaDa (Layered Scalable Data Center) as a new solution for building scalable and cost-effective data center networking infrastructures. The proposed topology organizes nodes in clusters of similar structure, then interconnect these clusters in a well-crafted pattern and system of coordinates for nodes to reduce the number of redundant connections between clusters, while maximizing connectivity. LaScaDa forwards packets between nodes using a new hierarchical row-based routing algorithm. The algorithm constructs the route to the source based on the modular difference between the source and destination coordinates. Furthermore, the proposed topology interconnects a large number of nodes using a small node degree. This strategy increases the number of directly connected clusters and avoids redundant connections. As a result, we get a good quality of nodes in terms of average path length (APL), bisection bandwidth, and aggregated bottleneck throughput. Experimental results show that LaScaDa has better performance than DCell, BCube, and HyperBcube in terms of scalability, while providing a good quality of service. 2020 IEEE |
Sponsor | Manuscript received January 22, 2017; revised January 30, 2018, August 17, 2018, and February 17, 2020; accepted June 9, 2020; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor K. Argyraki. Date of publication August 3, 2020; date of current version October 15, 2020. This work was supported by the Qatar National Research Fund (a member of Qatar Foundation) under NPRP Grant 6-718-2-298, by Qatar University Internal Grant IRCC-2020-001, and by Qatar National Library. (Corresponding author: Zina Chkirbene.) Zina Chkirbene and Ridha Hamila are with the College of Engineering, Qatar University, Doha 2713, Qatar (e-mail: zina.chk@gmail.com; hamila@qu.edu.qa). |
Language | en |
Publisher | IEEE |
Subject | Average path length Bisection bandwidth Data center network Network topology |
Type | Article |
Pagination | 2051-2064 |
Issue Number | 5 |
Volume Number | 28 |
Files in this item
This item appears in the following Collection(s)
-
Computer Science & Engineering [2402 items ]
-
Electrical Engineering [2649 items ]