LaCoDa: Layered connected topology for massive data centers. (1st April 2017)

• Record Type: Journal Article
• Authors: Chkirbene, Zina; Foufou, Sebti; Hamila, Ridha; Tari, Zahir; Zomaya, Albert Y.
• Is Part Of: Journal of network and computer applications. Volume 83(2017)
• Page Start: 169
• Page End: 180
• Publication Date: 2017-04-01
• Subjects: Data center network -- Network topology -- Average path length -- Bisection bandwidth; Microcomputers -- Periodicals; Computer networks -- Periodicals; Application software -- Periodicals; Micro-ordinateurs -- Périodiques; Réseaux d'ordinateurs -- Périodiques; Logiciels d'application -- Périodiques; Application software; Computer networks; Microcomputers; Periodicals; 004.05; 004
• DOI: 10.1016/j.jnca.2017.01.020
• Languages: English
• ISSNs: 1084-8045

Abstract

Abstract: One of the fundamental challenges of existing data centers is to design a network that interconnects massive number of servers, and therefore providing an efficient and fault-tolerant routing service to upper-layer applications. Several solutions have been proposed (e.g. FatTree, DCell and BCube), however they either scale too fast (i.e., double exponentially) or too slow. This paper proposes a new data center topology, called LaCoDa, that combines the advantages of previous topologies while avoiding their limitations. LaCoDa uses a small node degree that matches physical restriction for servers, and it also interconnects a large number of servers while reducing the wiring complexity and without affecting the existing servers. LaCoDa can interconnect up to millions of servers with a small number of port switches by increasing the number of directly connected clusters per layer, and therefore avoiding the cluster connections repetitions. The theoretical and experimental results show that the average path length (APL) of a 1000-node LaCoDa is smaller than the APL of a 23-node FlatTree and 11-node BCube and DCell. Moreover, with 6-port switches and a node degree of 4, the bisection bandwidth of 4.19 Million-node LaCoDa is 7% and 14% bigger than the bisection bandwidth of 310-node DCell and BCube, respectively. Consequently, LaCoDa provides better performance than DCel, BCube, FatTree in terms of average path length, throughput, latency and bisection bandwidth. Abstract : Highlights: Propose a new data center topology called LasCaDa that scales the entire network to millions of servers while reducing the average path length using small nodes degree and small port count switch. Design of new physical algorithm to interconnect the nodes while reducing the Average path length. Design of new fault-free routing algorithm to deliver the data between nodes and satisfy the dependability requirements for data center networks.