LEGUP: Using heterogeneity to reduce the cost of data center network upgrades

Proceedings of the 6th International Conference on Emerging Networking Experiments and Technologies, Co-NEXT'10

Volumn , Issue , 2010, Pages

  Curtis, Andrew R ^a   Keshav, S ^a   Lopez Ortiz, Alejandro ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL EQUIPMENT; BISECTION BANDWIDTH; CLOS NETWORKS; DATA CENTERS; FUNDAMENTAL LIMITATIONS; INTERCONNECTION TOPOLOGIES; LEGACY DATA; LINK CAPACITIES; NETWORK UPGRADES; TRAFFIC MATRICES;

BANDWIDTH; ITERATIVE METHODS; TELECOMMUNICATION NETWORKS; TOPOLOGY; TREES (MATHEMATICS);

NETWORK ARCHITECTURE;

EID: 79951586845     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1921168.1921187     Document Type: Conference Paper

References (30)

1. J. H. Ahn, N. Binkert, A. Davis, M. McLaren, and R. S. Schreiber. Hyperx: topology, routing, and packaging of efficient large-scale networks. In Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis (SC '09), 2009.
2. M. Al-Fares, A. Loukissas, and A. Vahdat. A scalable, commodity data center network architecture. In SIGCOMM, 2008.
3. V. E. Beneš. Mathematical Theory of Connecting Networks and Telephone Traffics. Academic Press, 1965.
4. T. Benson, A. Anand, A. Akella, and M. Zhang. Understanding data center traffic characteristics. In Proceedings of the 1st ACM workshop on Research on enterprise networking (WREN), 2009.
5. C. Clos. A study of non-blocking switching networks. Bell System Technical Journal, 32(5):406-424, 1953.
6. A. R. Curtis, S. Keshav, and A. López-Ortiz. LEGUP: Using heterogeneity to reduce the cost of data center network upgrades. Technical report, University of Waterloo, 2010.
7. N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan, and J. E. van der Merive. A flexible model for resource management in virtual private networks. In SIGCOMM, 1999.
8. L. Epstein and A. Levin. An APTAS for generalized cost variable-sized bin packing. SIAM J. Comput., 38(1):411-428, 2008.
9. A. Ford, C. Raiciu, M. Handley, and S. Barre. TCP extensions for multipath operation with multiple addresses. IETF, 2009.
10. A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. Maltz, P. Patel, and S. Sengupta. VL2: a scalable and flexible data center network. In SIGCOMM, 2009.
11. A. G. Greenberg, J. R. Hamilton, D. A. Maltz, and P. Patel. The cost of a cloud: research problems in data center networks. Computer Communication Review, 39(1):68-73, 2009.
12. C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y. Shi, C. Tian, Y. Zhang, and S. Lu. BCube: a high performance, server-centric network architecture for modular data centers. In SIGCOMM, 2009.
13. C. Guo, H. Wu, K. Tan, L. Shi, Y. Zhang, and S. Lu. Dcell: a scalable and fault-tolerant network structure for data centers. In SIGCOMM, 2008.
14. U. Hoelzle and L. A. Barroso. The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines. Morgan and Claypool Publishers, 2009.
15. K. Holmberg and D. Yuan. A lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research, 48(3):461-481, 2000. (Pubitemid 32415971)
16. F. K. Hwang and D. S. Richards. Steiner tree problems. Networks, 22(1):55-89, 1992.
17. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. on Comput., 3(4):299-325, 1974.
18. S. Kandula, S. Sengupta, A. Greenberg, and P. Patel. The nature of datacenter traffic: Measurements & analysis. In IMC, 2009.
19. A. Kershenbaum. Telecommunications network design algorithms. McGraw-Hill, 1993.
20. J. Kim, W. J. Dally, and D. Abts. Flattened butterfly: a cost-efficient topology for high-radix networks. SIGARCH Comput. Archit. News, 35(2), 2007.
21. M. Kodialam, T. V. Lakshman, and S. Sengupta. Maximum throughput routing of traffic in the hose model. In Infocom, 2006.
22. E. L. Lawler and D. E. Wood. Branch-and-bound methods: A survey. Operations Research, 14(4):699-719, 1966.
23. C. E. Leiserson. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans. Comput., 34(10):892-901, 1985.
24. J. Mudigonda, P. Yalagandula, M. Al-Fares, and J. C. Mogul. SPAIN: COTS data-center ethernet for multipathing over arbitrary topologies. In NSDI, 2010.
25. R. N. Mysore, A. Pamboris, N. Farrington, N. Huang, P. Miri, S. Radhakrishnan, and V. Subram. Portland: A scalable fault-tolerant layer 2 data center network fabric. In SIGCOMM, 2009.
26. C. Raiciu, C. Pluntke, S. Barre, A. Greenhalgh, D. Wischik, and M. Handley. Data center networking with multipath TCP. In Hotnets, 2010.
27. A. Rasala and G. Wilfong. Strictly non-blocking WDM cross-connects for heterogeneous networks. In STOC, 2000.
28. A. Tavakoli, M. Casado, T. Koponen, and S. Shenker. Applying NOX to the datacenter. In HotNets-VIII, 2009.
29. H. Wu, G. Lu, D. Li, C. Guo, and Y. Zhang. MDCube: a high performance network structure for modular data center interconnection. In CoNEXT, 2009.
30. R. Zhang-Shen and N. McKeown. Designing a predictable internet backbone with Valiant load-balancing. In Thirteenth International Workshop on Quality of Service (IWQoS '05), 2005.