N I ] 2 6 A ug 2 01 4 Space Shuffle : A Scalable , Flexible , and High-Bandwidth Data Center Network

The increasing need of cloud and big data applications requires data center networks to be scalable and bandwidth-rich. Current data center network architectures often use rigid topologies to increase network bandwidth. A major limitation is that they can hardly support incremental network growth. Recent work has been investigating new network architecture and protocols to achieve three important design goals of large data centers, namely, high throughput, routing and forwarding scalability, and flexibility for incremental growth. Unfortunately, existing data center network architectures focus on one or two of the above properties and pay little attention to the others. In this paper, we design a novel flexible data center network architecture, Space Shuffle (S2), which applies greedy routing on multiple ring spaces to achieve high-throughput, scalability, and flexibility. The proposed greedy routing protocol of S2 effectively exploits the path diversity of densely connected topologies and enables key-based routing. Extensive experimental studies show that S2 provides high bisectional bandwidth and throughput, near-optimal routing path lengths, extremely small forwarding state, fairness among concurrent data flows, and resiliency to network failures.

[1]  Chen Qian,et al.  Geographic Routing in $d$-Dimensional Spaces With Guaranteed Delivery and Low Stretch , 2011, IEEE/ACM Transactions on Networking.

[2]  Fan Chung Graham,et al.  The Average Distance in a Random Graph with Given Expected Degrees , 2004, Internet Math..

[3]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[4]  Chen Qian,et al.  ROME: Routing on metropolitan-scale Ethernet , 2012, 2012 20th IEEE International Conference on Network Protocols (ICNP).

[5]  Minlan Yu,et al.  BUFFALO: bloom filter forwarding architecture for large organizations , 2009, CoNEXT '09.

[6]  Antony I. T. Rowstron,et al.  Symbiotic routing in future data centers , 2010, SIGCOMM '10.

[7]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[8]  Chen Qian,et al.  Greedy Distance Vector Routing , 2011, 2011 31st International Conference on Distributed Computing Systems.

[9]  Albert G. Greenberg,et al.  The cost of a cloud: research problems in data center networks , 2008, CCRV.

[10]  Zhuowen Tu,et al.  Similarity network fusion for aggregating data types on a genomic scale , 2014, Nature Methods.

[11]  Emin Gün Sirer,et al.  Small-world datacenters , 2011, SoCC.

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

[13]  Ankit Singla,et al.  High Throughput Data Center Topology Design , 2013, NSDI.

[14]  Amin Vahdat,et al.  Hedera: Dynamic Flow Scheduling for Data Center Networks , 2010, NSDI.

[15]  Alejandro López-Ortiz,et al.  LEGUP: using heterogeneity to reduce the cost of data center network upgrades , 2010, CoNEXT.

[16]  Jennifer Rexford,et al.  Floodless in seattle: a scalable ethernet architecture for large enterprises , 2008, SIGCOMM '08.

[17]  Sanjeev Kumar,et al.  Finding a Needle in Haystack: Facebook's Photo Storage , 2010, OSDI.

[18]  László Gyarmati,et al.  Scafida: a scale-free network inspired data center architecture , 2010, CCRV.

[19]  Himanshu Shah,et al.  FireFly , 2014, SIGCOMM.

[20]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[21]  Ankit Singla,et al.  Jellyfish: Networking Data Centers Randomly , 2011, NSDI.

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

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

[24]  Albert G. Greenberg,et al.  The nature of data center traffic: measurements & analysis , 2009, IMC '09.

[25]  Joohwan Kim,et al.  Achieving the Optimal Steaming Capacity and Delay Using Random Regular Digraphs in P2P Networks , 2013, ArXiv.

[26]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[27]  Herbert A. David,et al.  Order Statistics , 2011, International Encyclopedia of Statistical Science.

[28]  Sujata Banerjee,et al.  DevoFlow: scaling flow management for high-performance networks , 2011, SIGCOMM.

[29]  Mark Handley,et al.  Improving datacenter performance and robustness with multipath TCP , 2011, SIGCOMM.

[30]  Georgios Ellinas,et al.  Path Routing in Mesh Optical Networks , 2007 .

[31]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[32]  Wenzhi Cui,et al.  DiFS: Distributed flow scheduling for adaptive routing in hierarchical data center networks , 2014, 2014 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[33]  Alejandro López-Ortiz,et al.  REWIRE: An optimization-based framework for unstructured data center network design , 2012, 2012 Proceedings IEEE INFOCOM.

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

[35]  Yuan Yu,et al.  Dryad: distributed data-parallel programs from sequential building blocks , 2007, EuroSys '07.

[36]  Alan L. Cox,et al.  PAST: scalable ethernet for data centers , 2012, CoNEXT '12.

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

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

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

[40]  Eddie Kohler,et al.  The Click modular router , 1999, SOSP.

[41]  Christian E. Hopps,et al.  Analysis of an Equal-Cost Multi-Path Algorithm , 2000, RFC.