On the Feasibility of Wireless Interconnects for High-throughput Data Centers

Data Centers (DCs) are required to be scalable to large data sets so as to accommodate ever increasing demands of resource-limited embedded and mobile devices. Thanks to the availability of recent high data rate millimeter-wave frequency spectrum such as 60GHz and due to the favorable attributes of this technology, wireless DC (WDC) exhibits the potentials of being a promising solution especially for small to medium scale DCs. This paper investigates the problem of throughput scalability of WDCs using the established theory of the asymptotic throughput of wireless multi-hop networks that are primarily proposed for homogeneous traffic conditions. The rate-heterogeneous traffic distribution of a data center however, requires the asymptotic heterogeneous throughput knowledge of a wireless network in order to study the performance and feasibility of WDCs for practical purposes. To answer these questions this paper presents a lower bound for the throughput scalability of a multi-hop rate-heterogeneous network when traffic generation rates of all nodes are similar, except one node. We demonstrate that the throughput scalability of conventional multi-hopping and the spatial reuse of the above bi-rate network is inefficient and henceforth develop a speculative 2-partitioning scheme that improves the network throughput scaling potentials. A better lower bound of the throughput is then obtained. Finally, we obtain the throughput scaling of an i.i.d. rate-heterogeneous network and obtain its lower bound. Again we propose a speculative 2-partitioning scheme to achieve a network with higher throughput in terms of improved lower bound. All of the obtained results have been verified using simulation experiments.

[1]  Donald F. Towsley,et al.  Data gathering capacity of large scale multihop wireless networks , 2008, 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[2]  D. Farnsworth A First Course in Order Statistics , 1993 .

[3]  Lei Yang,et al.  3D beamforming for wireless data centers , 2011, HotNets-X.

[4]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[5]  Aiko Pras,et al.  Inside dropbox: understanding personal cloud storage services , 2012, Internet Measurement Conference.

[6]  A. Varga,et al.  Using the OMNeT++ discrete event simulation system in education , 1999 .

[7]  Jörg Ott,et al.  Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication , 2012, SIGCOMM 2012.

[8]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[9]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[10]  Xinbing Wang,et al.  Capacity of Cooperative Ad Hoc Networks with Heterogeneous Traffic Patterns , 2011, 2011 IEEE International Conference on Communications (ICC).

[11]  Adrian Baddeley,et al.  Spatial Point Processes and their Applications , 2007 .

[12]  Gustavo Alonso,et al.  Modeling and computing throughput capacity of wireless multihop networks , 2008, Comput. Networks.

[13]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[14]  David A. Maltz,et al.  Network traffic characteristics of data centers in the wild , 2010, IMC '10.

[15]  S.D. Gunashekar,et al.  Wireless multi-hop throughput: Preliminary results from a simulation-based study , 2011, 2011 Loughborough Antennas & Propagation Conference.

[16]  Roger Sauter,et al.  Introduction to Probability and Statistics for Engineers and Scientists , 2005, Technometrics.

[17]  Stavros Toumpis Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic Patterns , 2008, IEEE Transactions on Wireless Communications.

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

[19]  Narayanaswamy Balakrishnan,et al.  A First Course in Order Statistics (Classics in Applied Mathematics) , 2008 .

[20]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[21]  Hamid R. Sadjadpour,et al.  The Capacity of Ad Hoc Networks with Heterogeneous Traffic Using Cooperation , 2010, 2010 Proceedings IEEE INFOCOM.

[22]  Darko Kirovski,et al.  On the feasibility of completely wireless datacenters , 2012, 2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[23]  Paramvir Bahl,et al.  Augmenting data center networks with multi-gigabit wireless links , 2011, SIGCOMM.

[24]  Toshiyuki Yamane,et al.  MIMO link design strategy for wireless data center applications , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[25]  ZhouXia,et al.  Mirror mirror on the ceiling , 2012 .

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

[27]  Devavrat Shah,et al.  Optimal throughput-delay scaling in wireless networks - part I: the fluid model , 2006, IEEE Transactions on Information Theory.

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

[29]  Xiaodong Liu,et al.  The architecture and traffic management of wireless collaborated hybrid data center network , 2013, SIGCOMM.

[30]  Piyush Gupta,et al.  An Experimental Scaling Law for Ad Hoc Networks , 2001 .

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

[32]  Andrea J. Goldsmith,et al.  Large wireless networks under fading, mobility, and delay constraints , 2004, IEEE INFOCOM 2004.

[33]  Ivan Stojmenovic,et al.  Data Centers as Software Defined Networks: Traffic Redundancy Elimination with Wireless Cards at Routers , 2013, IEEE Journal on Selected Areas in Communications.

[34]  Xiuzhen Cheng,et al.  Wireless data center networking , 2011, IEEE Wireless Communications.