DAC: Generic and automatic address configuration for data center networks

IEEE/ACM Transactions on Networking

Volumn 20, Issue 1, 2012, Pages 84-99

  Chen, Kai ^a   Guo, Chuanxiong ^b   Wu, Haitao ^b   Yuan, Jing ^c   Feng, Zhenqian ^d   Chen, Yan ^a   Lu, Songwu ^e   Wu, Wenfei ^f  

^a NORTHWESTERN UNIVERSITY   (United States)

^b MICROSOFT RESEARCH ASIA   (China)

^c TSINGHUA UNIVERSITY   (China)

^d NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^e UNIVERSITY OF CALIFORNIA   (United States)

^f UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Address configuration; Data center networks (DCNs); Graph isomorphism

Indexed keywords

ADDRESS CONFIGURATION; AUTO-CONFIGURATION; AUTOMATICALLY GENERATED; DATA CENTERS; DETECTION SCHEME; ERROR PRONES; GRAPH ISOMORPHISM; GRAPH ISOMORPHISM PROBLEM; IP ADDRESSS; LARGE DATA; LINK FAILURES; MAC ADDRESS; NETWORK TOPOLOGY; NODE DEGREE; PHYSICAL TOPOLOGY; TIME COMPLEXITY; TOPOLOGY INFORMATION; VIABLE SOLUTIONS;

ELECTRIC NETWORK TOPOLOGY; INTERNET PROTOCOLS;

SET THEORY;

EID: 84857364819     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2011.2157520     Document Type: Article

References (33)

1. R. H. Katz, "Tech titans building boom," IEEE Spectrum, vol. 46, no. 2, pp. 40-54, Feb. 2009.
2. L. Barroso, J. Dean, and U. Hölzle, "Web search for a planet: The Google cluster architecture," IEEE Micro, vol. 23, no. 2, pp. 22-28, Mar. 2003.
3. R. Droms, "Dynamic host configuration protocol," RFC 2131, Mar. 1997.
4. S. Ghemawat, H. Gobioff, and S.-T. Leung, "The Google file system," in Proc. ACM SOSP, 2003, pp. 29-43. (Pubitemid 40929686)
5. J. Dean and S. Ghemawat, "MapReduce: Simplified data processing on large clusters," in Proc. OSDI, 2004, pp. 137-150.
6. C. Guo, H.Wu,K.Tan,L. Shi,Y.Zhang, and S. Lu, "DCell:Ascalable and fault tolerant network structure for data centers," in Proc. ACM SIGCOMM, 2008, pp. 75-86.
7. 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 Proc. ACM SIGCOMM, 2009, pp. 63-74.
8. R. N. Mysore, A. Pamboris, N. Farrington, N. Huang, P. Miri, S. Radhakrishnan, V. Subramanya, and A. Vahdat, "PortLand: A scalable fault-tolerant layer 2 data center network fabric," in Proc. ACM SIGCOMM, 2009, pp. 39-50.
9. A.Greenberg,N. Jain, S.Kandula, C. Kim, P. Lahiri, D.Maltz, P. Patel, and S. Sengupta, "VL2: A scalable and flexible data center network," in Proc. ACM SIGCOMM, 2009, pp. 51-62.
10. "Human errors most common reason for data center outages," Oct. 2007 Online. Available: http://royal.pingdom.com/2007/10/30/human-errors-most- common-reason-for-data-center-outages
11. Z. Kerravala, "As the value of enterprise networks escalates, so does the need for configuration management," The Yankee Group, Boston, MA, Jan. 2004.
12. "What's behind network downtime?," Juniper Networks, Sunnyvale, CA, 2008.
13. R. McFarlane, "Where do failures originate?," Nov. 2005 Online. Available: http://searchdatacenter.techtarget.com/news/column/0,294698,sid80- gci1148903,00.html
14. "GI problem," Online. Available: http://en.wikipedia.org/wiki/ Graph-isomorphism-problem
15. B. D. McKay, "Practical graph isomorphism," Cong. Numer., vol. 30, pp. 45-87, 1981.
16. P. T. Darga, K. A. Sakallah, and I. L. Markov, "Faster symmetry discovery using sparsity of symmetries," in Proc. 45th ACM/IEEE Design Autom. Conf., 2008, pp. 149-154.
17. D. Li, C. Guo, H. Wu, K. Tan, Y. Zhang, and S. Lu, "FiConn: Using backup port for server interconnection in data centers," in Proc. IEEE INFOCOM, 2009, pp. 2276-2285.
18. E. M. Luks, "Isomorphism of graphs of bounded valence can be tested in polynomial time," J. Comput. Syst. Sci., vol. 25, no. 1, pp. 42-65, 1982.
19. "Graph automorphism," Online. Available: http://en.wikipedia. org/wiki/Graph-automorphism
20. K. Chen, C. Guo, H. Wu, J. Yuan, Z. Feng, Y. Chen, S. Lu, and W. Wu, "Generic and automatic address configuration for data center networks," MSR-TR-2011-62, 2011.
21. P. T. Darga, M. H. Liffiton, K. A. Sakallah, and I. L. Markov, "Exploiting structure in symmetry generation forCNF," in Proc. 41st ACM/IEEE Design Autom. Conf., 2004, pp. 530-534.
22. "Data center network overview," Extreme Networks, Santa Clara, CA, 2009 Online. Available: http://www.foss.ae/wp/wp-content/uploads/downloads/ info/Extreme/Data-Centre/Extreme%20Networks- %20Data%20Centre%20Solution%20Overview.pdf
23. "Maximum common subgraph problem," Online. Available: http://en.wikipedia.org/wiki/Maximum-common-subgraph-isomorphism-problem
24. V. Kann, "On the approximability of the maximum common subgraph problem," in Proc. Annu. Symp. Theoret. Aspects Comput. Sci., 1992, pp. 377-388.
25. C. Guo, Personal communications with operator of a large enterprise data center, 2009.
26. E. Kohler, R. Morris, B. Chen, J. Jannotti, and M. F. Kaashoek, "The clickmodular router," Trans. Comput. Syst., vol. 18, no. 3, pp. 263-297, 2000.
27. "DAC implementation," Computer Science Department, Northwestern University, Evanston, IL, 2010 Online. Available: http://www.cs.northwestern. edu/-kch670/#software
28. T. Rodeheffer, C. Thekkath, and D. Anderson, "SmartBridge: A scalable bridge architecture," in Proc. ACM SIGCOMM, 2000, pp. 205-216.
29. A. Myers, E. Ng, and H. Zhang, "Rethinking the servicemodel: Scaling Ethernet to a million nodes," presented at the HotNets, 2004.
30. R. Perlman, "Rbridges: Transparent routing," in Proc. IEEE INFOCOM, 2004, vol. 2, pp. 1211-1218.
31. C.Kim,M. Caesar, and J. Rexford, "Floodless in SEATTLE:Ascalable ethernet architecture for large enterprises," in Proc. ACM SIGCOMM, 2008, pp. 3-14.
32. S. Thomson and T. Narten, "IPv6 stateless address autoconfiguration," Expired Internet draft, Dec. 1998.
33. S. Cheshire, B. Aboba, and E. Guttman, "Dynamic configuration of IPv4 link-local addresses," IETF draft, 2003.