IBCube: An Economical and Incremental Datacenter Network

IBCube: An Economical and Incremental Datacenter Network

Qiong Hu, Hanhua Chen, Hai Jin, Chen Tian, Aobing Sun, Tongkai Ji
Copyright: © 2018 |Pages: 20
DOI: 10.4018/IJWSR.2018010102
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Datacenter networks have attracted a lot of research interest in the past few years. BCube is proved to be a promising scheme due to its low cost. By using a recursive construction scheme, BCube can exponentially scale a datacenter. Industry experiences, however, articulate the importance of incremental expansion of datacenter. In this article, the authors show that BCube's expanding scheme suffers low utilization of switch ports. They propose IBCube, a novel economical design for incrementally building datacenter networks. The insight is that: by letting the number of switches in each BCube layer equal the number of the building blocks, the authors can enable the switch ports to be fully utilized to support the total number of network interface cards of the deployed servers in the datacenters. Accordingly, their IBCube designs a novel automatic port allocation scheme. Simulation results show that the IBCube design reduces the budget for the datacenter networks by 94% as well as improves the packet delay and throughput by 10.3% and 11.5%, respectively, compared to the previous partial BCube design.
Article Preview
Top

1. Introduction

With the emergence of cloud services and applications, how to efficiently build datacenters becomes an important issue (Liu et al. 2016). Maximizing the profits of datacenters is a major concern of datacenter operators for economical consideration (Zhan et al. 2016). Among the budget of a fully functional datacenter, a fraction of 15% goes to networking, i.e., the network equipments and the wires (Greenberg et al. 2008). In recent years, there have been a number of proposals for efficient datacenter networks (Lee et al. 2016; Ports et al. 2015; Zhu et al. 2015; Perry et al. 2014). Existing systems adopt quite different approaches for constructing datacenter networks (Al-Fares et al. 2008; Guo et al. 2009; Guo et al. 2008).

Existing datacenter network architectures can be classified into three styles, switch-centric, server-centric and hybrid designs (Popa et al. 2010). The switch-centric architecture utilizes switches for packet forwarding (e.g., the fat-tree based architecture (Al-Fares et al. 2008) uses switches for packet forwarding; Arjun et al. (2015) propose to use Clos topologies for connecting the switches to achieve good scalability). Different from the switch-centric design, the server-centric architecture relies on servers for packet forwarding, i.e., packets are forwarded between servers instead of switches. For instance, Abu-libdeh et al. (2010) design an architecture which connects servers using a 3D torus structure. By considering hybrid architectures, Guo et al. propose the DCell (2008) and BCube (2009) structures. DCell (Guo et al. 2008) and BCube (Guo et al. 2009) architectures forward packets using a combination of switches and servers. To evaluate the cost efficiency of existing diverse datacenter networking designs, Stoica et al. (2010) propose a high-level model to quantify and compare the cost of a datacenter network. Stoica’s results show that BCube achieves the lowest cost among those architectures (Popa et al. 2010).

Figure 1.

The port utilization in partial BCubek with n=8 (N ∈ [2, 512])

IJWSR.2018010102.f01

Complete Article List

Search this Journal:
Reset
Volume 21: 1 Issue (2024)
Volume 20: 1 Issue (2023)
Volume 19: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 18: 4 Issues (2021)
Volume 17: 4 Issues (2020)
Volume 16: 4 Issues (2019)
Volume 15: 4 Issues (2018)
Volume 14: 4 Issues (2017)
Volume 13: 4 Issues (2016)
Volume 12: 4 Issues (2015)
Volume 11: 4 Issues (2014)
Volume 10: 4 Issues (2013)
Volume 9: 4 Issues (2012)
Volume 8: 4 Issues (2011)
Volume 7: 4 Issues (2010)
Volume 6: 4 Issues (2009)
Volume 5: 4 Issues (2008)
Volume 4: 4 Issues (2007)
Volume 3: 4 Issues (2006)
Volume 2: 4 Issues (2005)
Volume 1: 4 Issues (2004)
View Complete Journal Contents Listing