Wireless link scheduling for data center networks

Data Center Networks (DCNs) suffer from the congestions caused by unbalanced traffic distributions. Nevertheless, it is difficult to address such a challenge with the existent Ethernet-based DCN architecture. Wireless networking has been considered as a viable approach with a high potential to tackle the problem due to its flexibility. This paper presents Wireless Link Scheduling for Data Center Networks (WLS-DCN) to provide a feasible wireless DCN. More specifically, we propose a wireless DCN architecture as well as a scheduling mechanism. In our wireless scheduling, two different optimization objectives are considered, with one targeting the unbalanced traffic distribution and one maximizing the total network utility, under the constraints of limited wireless resources and co-channel interference. We propose two heuristics for the two problems and carry out extensive simulation study to validate the performance of our design. Our results demonstrate that WLSDCN can significantly improve the performance of DCN.

[1]  Amin Vahdat,et al.  Helios: a hybrid electrical/optical switch architecture for modular data centers , 2010, SIGCOMM '10.

[2]  Lei Shi,et al.  Dcell: a scalable and fault-tolerant network structure for data centers , 2008, SIGCOMM '08.

[3]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[4]  Ming Zhang,et al.  Understanding data center traffic characteristics , 2010, CCRV.

[5]  Aravind Srinivasan,et al.  Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks , 2009, IEEE INFOCOM 2009.

[6]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[7]  Paramvir Bahl,et al.  Flyways To De-Congest Data Center Networks , 2009, HotNets.

[8]  Haitao Wu,et al.  BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.

[9]  Ness B. Shroff,et al.  On the Complexity of Scheduling in Wireless Networks , 2010, EURASIP J. Wirel. Commun. Netw..

[10]  P.F.M. Smulders,et al.  Exploiting the 60 GHz band for local wireless multimedia access: prospects and future directions , 2002, IEEE Commun. Mag..

[11]  H. Kuhn The Hungarian method for the assignment problem , 1955 .

[12]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[13]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[14]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[15]  Xiaojun Lin,et al.  A Distributed and Provably-Efficient Joint Channel-Assignment , Scheduling and Routing Algorithm for Multi-Channel Multi-Radio Wireless Mesh Networks , .

[16]  Haitao Wu,et al.  FiConn: Using Backup Port for Server Interconnection in Data Centers , 2009, IEEE INFOCOM 2009.

[17]  GhemawatSanjay,et al.  The Google file system , 2003 .

[18]  Amin Vahdat,et al.  PortLand: a scalable fault-tolerant layer 2 data center network fabric , 2009, SIGCOMM '09.