Surviving failures in bandwidth-constrained datacenters

Computer Communication Review

Volumn 42, Issue 4, 2012, Pages 431-442

  Bodík, Peter ^a   Mani, Pradeepkumar ^a   Menache, Ishai ^b   Maltz, David A ^a   Chowdhury, Mosharaf ^a   Stoica, Ion ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bandwidth; Datacenter networks; Fault tolerance

Indexed keywords

EID: 84894540177     PISSN: 01464833     EISSN: 19435819     Source Type: Conference Proceeding    
DOI: 10.1145/2377677.2377760     Document Type: Conference Paper

References (38)

1. The avoidable cost of downtime, ca Technologies, http://goo.gl/SC6Ve. 2010.
2. Calculating the cost of data center outages. Ponemon Institute, http://goo.gl/ijLoV, 2011, .
3. S. Agarwal, J. Dunagan, N. Jain, S. Saroiu and A. Wolman. Volley: Automated data placement for geo-distrihuted cloud services. In NSDI, pages 17-32, 2010.
4. Amazon.com. Summary of the Amazon EC2. Amazon EBS, and Amazon RDS service event in the EU west region, http://aws.amazon.com/message/2329B7/, 2011.
5. K. Amiri, D. Pelrou, G. R. Ganger, and G. A. Gibson. Dynamic function placement for data-intensive cluster computing. In ATC, 2000.
6. H. Ballani, P. Costa, T. Karagiannis. and A. Rowstron. Towards predictable datacenter networks. In ACM SIGCOMM, 2011.
7. N. Bansal, R. Bhagwan, N. Jain, Y. Park, D. S. Turaga, and C. Venkatramani. Towards optimal resource allocation in partial-fault tolerant applications. In INFOCOM, pages 1319-1327. 2008.
8. T. Benson, A. Akella, and D. A. Maltz. Network traffic characteristics of data centers in the wild. In IMC, pages 267-280, 2010.
9. D. Bertsekas. Nonlinear programming. Athena Scientific, 1999.
10. M. Chowdhury and R. Boutaha. A survey of network virtualization. Computer Network, 54(5):862-876, 2010.
11. M. Chowdhury, M. R. Rahman, and R. Boutaha. ViNF.Yard: Virtual network embedding algorithms with coordinated node and link mapping. ACM/IEEE ToN. 2011.
12. J. Dean. Designs, lessons and advice from building large distributed systems. LADIS '09 keynote talk, 2009.
13. N. G. Duffield, P Goyal, A Grecnberg, P. Mishra, K. K. Rainaknshnan and J. E. van dor Merive. A flexible model for resource management in virtual private networks. In ACM SIGCOMM. 1999.
14. D. Ford, F Lahellc, F I Popovici, M. Stokely, V.-A. Truong, I. Barroso, C. Grimes and S Quinlan. Availability in globally distributed storage systems In OSDI, 2010.
15. P Gill, N Jain, and N Nagappan. Understanding network failures in data centers measurement, analysis, and implications. In SIGCOMM. pages 350-361, 2011.
16. A Grecnberg, 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 ACM SIGCOMM. pages 51-62, 2009.
17. C. Guo, G Lu, H. J. Wang, S. Yang, C. Kong, P. Sun, W. Wu, and Y Zhang. Second Net: A data center network virtualization architecture with bandwidth guarantees. In ACM CoNext, 2010.
18. A Gupta. J M Kleinherg. A Kumar, R Rastogi, and B. Yener. Provisioning a virtual private network: A network design problem for multicommodity flow In ACM STOC. pages 389-398, 2001.
19. J Hastad. Clique is hard to approximate withinn 1- e. Acta Mathematica, 182(1): 105-142, 1999.
20. S Kandula, S. Sengupta, A Greenberg, P. Patel, and R. Chaiken. The nature of data center traffic: measurements & analysis. In IMC. 2009.
21. G. Karypis and V. Kumar A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sri. Compul., 20:359-392 December 1998.
22. R Krauthgamer, J Naor. and R. Schwartz. Partitioning graphs into balanced components In SOIM. pages 942-949, 2009. 231.
23. M Kurant and P Thiran Survivable routing ol mesh topologies in IP-over WDM networks by recursive graph contraction. IEEE JSAC 25(5):922-933, 2007.
24. T. Lam, S Radhakrishnan, A. Vahdat, and G. Varghese. NetShare: Virtualizing data center networks across services. Technical Report CS2010-0957, UC San Diego, 2010.
25. W. Lau and S. Jha. Failure-oriented path restoration algorithm for survivable networks. IEEE TNSM. 1( 1): 11-20. 2008.
26. Y Liu and K S. Trivedi. A general framework for network survivability quantification. In MMH. pages 369-378. 2004.
27. J. Lu and J. Turner. Efficient mapping of virtual networks onto a shared substrate. Technical Report WUCSE-2006-35. Washington University. 2006.
28. X. Meng, V. Pappas. and I. Zhang. Improving the scalability of data center networks with traffic-aware virtual machine placement. In INFOCOM. 2010.
29. R N. Mysore. A. Pamhoris, N. Partington, N. Huang, P. Miri. S. Radhakrishnan. V. Subramanya. and A. Vahdat. Port Land: A scalable fault-tolerant layer 2 data center network fabric. In ACM SIGCOMM. pages 19-50. 2009.
30. S. Raghunath, K K. Kamakrishnan, S Kalyanaraman and C. Chase. Measurement based characterization and provisioning of IP VPNs. In ACM IMC. pages 342-355, 2004.
31. M R. Rahman, I. Aib. and R. Boutaha. Survivable virtual network embedding. In IFIP Networking, pages 40-52, 2010.
32. R Ricci, C. Alfeld, and J. Lcprcau. A solver for the network testbed mapping problem. ACM SIGCOMM CCR. 33(2):65-81, April 2003.
33. A. Shich. S. Kandula. A. Grecnberg, and C. Kim. Sharing the data center network. In USENIX NSDI. 2011.
34. W Szeto, Y. Iraqi, and R Boutaha. A multi-commodity flow based approach to virtual network resource allocation. In IEEE GLOBF.COM. pages 3004-3008. 2(X).
35. K. Thulasiraman, M. S, Javed, and G. L. Xue. Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP over-WDM optical networks. In IEEE INFOCOM. 2009.
36. H. Yu., P. B. Gibbons, and S. Nath. Availability of multi-object operations. In NSDI. 2006.
37. M. Yu, Y. Yi. J Rexford. and M Chiang. Rethinking virtual network embedding: Substrate support for path splitting and migration. ACM SIGCOMM CCR. 38(2): 17-29, April 2008.
38. Y. Zhu and M Ammar. Algorithms for assigning substrate network resources to virtual network components. In IEEE INFOCOM. 2006.