Data Centers as Software Defined Networks: Traffic Redundancy Elimination with Wireless Cards at Routers

We propose a novel architecture of data center networks (DCN), which adds wireless network card to both servers and routers. Existing traffic redundancy elimination (TRE) mechanisms reduce link loads and increase network capacity in several environments by removing strings that have appeared in earlier packets through encoding and decoding them several hops downstream. This article is the first to explore TRE mechanisms in large-scale DCNs and the first to exploit cooperative TRE among servers. Moreover, it also achieves the `logically centralized' control over the physically distributed states in emerging software defined networks (SDN) paradigm, by sharing information among servers and routers in data centers with wireless cards. We first formulate the TREDaCeN (TRE in Data Center Networks) problem and reduce the cycle cover problem to prove that finding an optimal caching task assignment for TREDaCeN problem is NP-hard. We further describe an offline TREDaCeN algorithm which is proved to have good approximation ratio. We then discuss efficient online zero-delay and semi-distributed implementations of TREDaCeN supported by physical proximity of servers and routers, enabling status updates in a single wireless transmission, using an efficient prioritized schedule. We also address online cache replacement and consistency of information in servers and routers with and without delay. Our framework is tested on different parameters and shows superior performance in comparison to other mechanisms (imported directly to this setting). Our results show the robustness and the trade-off between the `logically centralized' implementation and the overhead on handling inconsistency of distributed information in DCN.

[1]  Viktor K. Prasanna,et al.  Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems , 2012 .

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

[3]  Xiuzhen Cheng,et al.  Wireless link scheduling for data center networks , 2011, ICUIMC '11.

[4]  George Varghese,et al.  EndRE: An End-System Redundancy Elimination Service for Enterprises , 2010, NSDI.

[5]  Vyas Sekar,et al.  SmartRE: an architecture for coordinated network-wide redundancy elimination , 2009, SIGCOMM '09.

[6]  Srinivasan Seshan,et al.  Packet caches on routers: the implications of universal redundant traffic elimination , 2008, SIGCOMM '08.

[7]  Ivan Stojmenovic,et al.  Cooperative Redundancy Elimination in Data Center Networks with Wireless Cards at Routers , 2012, 2012 32nd International Conference on Distributed Computing Systems Workshops.

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

[9]  Bodo Manthey,et al.  Computing Cycle Covers without Short Cycles , 2001, ESA.

[10]  Aditya Akella,et al.  Redundancy in network traffic: findings and implications , 2009, SIGMETRICS '09.

[11]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[12]  George Pallis,et al.  Content Delivery Networks: Status and Trends , 2003, IEEE Internet Comput..

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

[14]  Ravi Prakash,et al.  Wireless Data Center with Millimeter Wave Network , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

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

[16]  Sumanta Saha,et al.  CombiHeader: Minimizing the number of shim headers in redundancy elimination systems , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

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

[18]  Xiuzhen Cheng,et al.  Dynamic Scheduling for Wireless Data Center Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[19]  Vivek S. Pai,et al.  Towards understanding modern web traffic , 2011, SIGMETRICS '11.

[20]  Ben Y. Zhao,et al.  Mirror mirror on the ceiling: flexible wireless links for data centers , 2012, SIGCOMM.

[21]  Shin Gyu Kim,et al.  Improving MapReduce Performance by Exploiting Input Redundancy , 2011, J. Inf. Sci. Eng..

[22]  Darko Kirovski,et al.  On the Feasibility of Completely Wirelesss Datacenters , 2013, IEEE/ACM Transactions on Networking.

[23]  G. Voelker,et al.  On the scale and performance of cooperative Web proxy caching , 2000, OPSR.

[24]  David Wetherall,et al.  A protocol-independent technique for eliminating redundant network traffic , 2000, SIGCOMM.

[25]  Carey L. Williamson,et al.  Enhancing redundant network traffic elimination , 2012, Comput. Networks.

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

[27]  Ari Luotonen,et al.  World-Wide Web Proxies , 1994, Comput. Networks ISDN Syst..

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

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

[30]  David A. Maltz,et al.  Data center TCP (DCTCP) , 2010, SIGCOMM 2010.

[31]  Anja Feldmann,et al.  Logically centralized?: state distribution trade-offs in software defined networks , 2012, HotSDN '12.