Space shuffle: A scalable, flexible, and high-bandwidth data center network

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2014, Pages 13-24

  Yu, Ye ^a   Qian, Chen ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; NETWORK PROTOCOLS; NETWORK ROUTING; SCALABILITY; TOPOLOGY;

DATA CENTER NETWORKS; FORWARDING STATE; GLOBAL INFORMATIONS; INCREMENTAL NETWORKS; KEY-BASED ROUTING; NETWORK BANDWIDTH; ROUTING DECISIONS; SCALABILITY PROBLEMS;

NETWORK ARCHITECTURE;

EID: 84920061781     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2014.23     Document Type: Conference Paper

References (41)

1. Apache hadoop. http://hadoop.apache.org/
2. Ibm cplex optimizer. http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/
3. Implementation of k-shortest path algorithm. http://code.google.com/p/kshortest-paths/
4. H. Abu-Libdeh et al. Symbiotic routing in future data centers. In Proc. of ACM SIGCOMM, 2010
5. M. Al-Fares, A. Loukissas, and A. Vahdat. A scalable, commodity data center network architecture. In Proc. of ACM SIGCOMM, 2008
6. M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat. Hedera: dynamic flow scheduling for data center networks. In Proceedings of USENIX NSDI, 2010
7. T. Benson, A. Akella, and D. A. Maltz. Network traffic characteristics of data centers in the wild. In Proceedings of ACM IMC, 2010
8. E. Bouillet. Path routing in mesh optical networks. John Wiley & Sons, 2007
9. F. Chung and L. Lu. The average distance in a random graph with given expected degrees. Internet Mathematics, 2003
10. C. Clos. A study of non-blocking switching networks. Bell System Technical Journal, 1953
11. W. Cui and C. Qian. Difs: Distributed flow scheduling for adaptive routing in hierarchical data center networks. In Proc. of ACM/IEEE ANCS, 2014
12. A. R. Curtis, T. Carpenter, M. Elsheikh, A. Lopez-Ortiz, and S. Keshav. Rewire: An optimization-based framework for unstructured data center network design. In Proc. of IEEE Infocom, 2012
13. A. R. Curtis, S. Keshav, and A. Lopez-Ortiz. Legup: using heterogeneity to reduce the cost of data center network upgrades. In Proc. of ACM CoNEXT, 2010
14. H. David and H. Nagaraja. Order Statistics. Wiley, 2004
15. J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters.communications of the ACM, 2008
16. A. Greenberg, J. Hamilton, D. A. Maltz, and P. Patel. The cost of a cloud: Research problems in data center networks. ACM Sigcomm CCR, 2008
17. A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz, P. Patel, and S. Sengupta. Vl2: a scalable and flexible data center network. In Proceedings of ACM SIGCOMM, 2009
18. C. Guo et al. Dcell: a scalable and fault-Tolerant network structure for data centers. In Proc. of ACM SIGCOMM, 2008
19. C. Guo et al. Bcube: a high performance, server-centric network architecture for modular data centers. In Proc. of ACM SIGCOMM, 2009
20. L. Gyarmati and T. A. Trinh. Scafida: a scale-free network inspired data center architecture. ACM Sigcomm CCR, 2010
21. N. Hamedazimi et al. Firefly: A reconfigurable wireless data center fabric using free-space optics. In Proc. of ACM SIGCOMM, 2014
22. C. Hopps. Analysis of an equal-cost multi-path algorithm. RFC 2992, 2000
23. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: distributed data-parallel programs from sequential building blocks. In Proc. of ACM EuroSys, 2007
24. R. Jain, D. Chiu, and W. Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. DEC Research Report TR-301, 1984
25. S. Kandula, S. Sengupta, A. Greenberg, P. Patel, and R. Chaiken. The nature of data center traffic: measurements & analysis. In Proceedings of ACM IMC, 2009
26. C. Kim, M. Caesar, and J. Rexford. Floodless in SEATTLE: A Scalable Ethernet Architecture for Large Enterprises. In Proc. of Sigcomm, 2008
27. J. Kim and R. Srikant. Achieving the optimal steaming capacity and delay using random regular digraphs in p2p networks. CoRR, abs/1308.6807, 2013
28. S. S. Lam and C. Qian. Geographic Routing in d-dimensional Spaces with Guaranteed Delivery and Low Stretch. In IEEE/ACM Transactions on Networking
29. N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner. Openflow: Enabling innovation in campus networks. SIGCOMM Comput.commun. Rev., 2008
30. J. C. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma, A. R. Curtis, and S. Banerjee. Devoflow: scaling flow management for high-performance networks. In Proc. of ACM SIGCOMM, 2011
31. R. N. Mysore et al. Portland: a scalable fault-Tolerant layer 2 data center network fabric. In Proceedings of ACM SIGCOMM, 2009
32. C. Qian and S. Lam. ROME: Routing On Metropolitan-scale Ethernet. In Proceedings of IEEE ICNP, 2012
33. C. Qian and S. S. Lam. Greedy Distance Vector Routing. In Proceedings of IEEE ICDCS, June 2011
34. D. Realty. 2013: What is driving the north america/europe data center market? http://www.digitalrealty.com/us/knowledge-centerus/? cat=Research
35. J.-Y. Shin, B. Wong, and E. G. Sirer. Small-world datacenters. In Proc. of ACM SOCC, 2011
36. A. Singla, P. B. Godfrey, and A. Kolla. High throughput data center topology design. In Proc. of USENIX NSDI, 2014
37. A. Singla, C.-Y. Hong, L. Popa, and P. B. Godfrey. Jellyfish: Networking data centers randomly. In Proc. of USENIX NSDI, 2012
38. B. Stephens, A. Cox, W. Felter, C. Dixon, and J. Carter. PAST: Scalable Ethernet for Data Centers. In Proceedings of ACM CoNEXT, 2012
39. B. Wang et al. Similarity network fusion for aggregating data types on a genomic scale. Nature methods, 11(3):333-337, 2014
40. J. Yen. Finding the k shortest loopless paths in a network. Manegement Science, 1971
41. M. Yu, A. Fabrikant, and J. Rexford. Buffalo: Bloom filter forwarding architecture for large organizations. In Proceedings of ACM CoNEXT, 2009