Ji-Yong Shin
Emin Gün Sirer
ABSTRACT
In this paper, we propose an unorthodox topology for datacenters that eliminates all hierarchical switches in favor of connecting nodes at random according to a small-world-inspired distribution. Specifically, we examine topologies where the underlying nodes are connected at the small scale in a regular pattern, such as a ring, torus or cube, such that every node can route efficiently to nodes in its immediate vicinity, and amended by the addition of random links to nodes throughout the datacenter, such that a greedy algorithm can route packets to far away locations efficiently. Coupled with geographical address assignment, the resulting network can provide content routing in addition to traditional routing, and thus efficiently implement key-value stores. The irregular but self-similar nature of the network facilitates constructing large networks easily using prewired, commodity racks. We show that Small-World Datacenters can achieve higher bandwidth and fault tolerance compared to both conventional hierarchical datacenters as well as the recently proposed CamCube topology. Coupled with hardware acceleration for packet switching, small-world datacenters can achieve an order of magnitude higher bandwidth than a conventional datacenter, depending on the network traffic.
- H. Abu-Libdeh, P. Costa, A. Rowstron, G. O'Shea, and A. Donnelly. Symbiotic Routing in Future Data Centers. In Proceedings of the ACM SIGCOMM Conference on Data Communication, pages 51--62, New Delhi, India, August 2010. Google Scholar
Digital Library
- R. Bolla and R. Bruschi. Linux Software Router: Data Plane Optimization and Performance Evaluation. In Journal of Networks, 2(3):6--17, June 2007.Google ScholarCross Ref
- T. Benson, A. Akella, and D. A. Maltz. Network Traffic Characteristics of Data Centers in the Wild. In Proceedings of the Conference on Internet Measurement, pages 267--280, Melbourne, Australia, November 2010. Google ScholarDigital Library
- A. L. Barabasi and R. Albert. Emergence of Scaling in Random Networks. In Science, 286(5439):509--512, October 1999.Google Scholar
- Cisco. Cisco Nexus 5000 Series Architecture: The Building Blocks of the Unified Fabric. http://www.cisco.com/en/US/prod/collateral/switches/ps9441/ps9670/white_paper_c11-462176.pdf, 2009.Google Scholar
- Cisco. Cisco Catalyst 4948 Switch. http://www.cisco.com/en/US/prod/collateral/switches/ps5718/ps6021/product_data_sheet0900aecd8017a72e.pdf, 2010.Google Scholar
- Cisco. Cisco Nexus 7000 F-Series Modules. http://www.cisco.com/en/US/prod/collateral/switches/ps9441/ps9402/at_a_glance_c25-612979.pdf, 2010.Google Scholar
- Cisco. Cisco Data Center Infrastructure 2.5 Design Guide. http://www.cisco.com/en/US/docs/solutions/Enterprise/Data_Center/DC_Infra2_5/DCI_SRND_2_5_book.html, March 2010.Google Scholar
- M. Dobrescu, N. Egi, K. Argyraki, B.-G. Chun, K. Fall, G. Iannaccone, A. Knies, M. Manesh, and S. Ratnasamy. RouteBricks: Exploiting Parallelism to Scale Software Routers. In Proceedings of the ACM Symposium on Operating Systems Principles, pages 15--28, Big Sky, MT, USA, October 2009. Google ScholarDigital Library
- E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. In Numerische Mathematik, 1:269--271, 1959.Google ScholarDigital Library
- B. Fitzpatrick. Distributed Caching with Memcached. In Linux Journal, 124, August 2004. Google ScholarDigital Library
- 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 the ACM SIGCOMM Conference on Data Communication, pages 51--62, Barcelona, Spain, August 2009. Google ScholarDigital Library
- 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 Proceedings of the ACM SIGCOMM Conference on Data Communication, pages 63--74, Barcelona, Spain, August 2009. Google ScholarDigital Library
- 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 Proceedings of the ACM SIGCOMM Conference on Data Communication, pages 75--86, Seattle, WA, USA, August 2008. Google ScholarDigital Library
- L. Gyarmati and T. A. Trinh. Scafida: A Scale-Free Network Inspired Data Center Architecture. In SIGCOMM Compututer Communication Review, 40(5):5--12, October 2010. Google ScholarDigital Library
- S. D. Gribble. A Design Framework and a Scalable Storage Platform to Simplify Internet Service Construction. In Ph.D. Thesis, U.C. Berkeley, September 2000. Google ScholarDigital Library
- S. Han, K. Jang, K. Park, and S. Moon. PacketShader: A GPU-Accelerated Software Router. In Proceedings of the ACM SIGCOMM Conference on Data Communication, pages 195--206, New Delhi, India, August 2010. Google ScholarDigital Library
- M. D. Humphries and K. Gurney. Network 'Small-World-Ness': A Quantitative Method for Determining Canonical Network Equivalence. In PLoS ONE, 3(4):1--10, April 2008.Google Scholar
- HP. HP Rack 10000 G2 Series Quick Spec, DA12402. http://h18004.www1.hp.com/products/quickspecs/12402i_na/12402_na.pdf, 2011.Google Scholar
- E. Kranakis, H. Singh, and J. Urrutia. Compass Routing on Geometric Networks. In Proceedings of the Canadian Conference on Computational Geometry, pages 51--54, Vancouver, British Columbia, Canada, August 1999.Google Scholar
- J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the ACM Symposium on Theory of Computing, pages 163--170, Portland, OR, USA, May 2000. Google ScholarDigital Library
- J. Kleinberg. Small-World Phenomena and the Dynamics of Information. In Proceedings of the Conference on Neural Information Processing Systems, pages 431--438, Vancouver, BC, Canada, December 2001.Google Scholar
- J. Kleinberg. The Small-World Phenomenon and Decentralized Search. In SIAM News, 37(3), April 2004.Google Scholar
- J. Kleinberg. Complex Networks and Decentralized Search Algorithms. In Proceedings of the International Congress of Mathematicians, pages 1019--1044, Madrid, Spain, August 2006.Google Scholar
- S. Kandula, S. Sengupta, A. Greenberg, P. Patel, and R. Chaiken. The Nature of Data Center Traffic: Measurements & Analysis. In Proceedings of the Conference on Internet Measurement, pages 202--208, Chicago, IL, USA, November 2009. Google ScholarDigital Library
- R. V. Kulkarni, E. Almaas, and D. Stroud. Exact Results and Scaling Properties of Small-World Networks. In Physical Review Letters, 61(4):4268--4271, April 2000.Google Scholar
- G. Lu, C. Guo, Y. Li, Z. Zhou, T. Yuan, H. Wu, Y. Xiong, R. Gao, and Y. Zhang. ServerSwitch: A Programmable and High Performance Platform for Data Center Networks. In Proceedings of the Symposium on Networked System Design and Implementation, Boston, MA, USA, March 2011. Google ScholarDigital Library
- D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In Proceedings of the Symposium on PRinciples of Distributed Computing, pages 183--192, Monterey, CA, USA, July 2002. Google ScholarDigital Library
- J. Moy. OSPF Version 2. RFC i2328. April 1998.Google Scholar
- S. Milgram. The Small World Problem. In Psychology Today, 2:60--67, 1967.Google Scholar
- G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed Hashing in a Small World. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, pages 127--140, Seattle, WA, USA, March 2003. Google ScholarDigital Library
- J. Naous, G. Gibb, S. Bolouki, and N. McKeown. NetFPGA: Reusable Router Architecture for Experimental Research. In Proceedings of the ACM workshop on Programmable Routers for Extensible Services of Tomorrow, pages 1--7, Seattle, WA, USA, August 2008. Google ScholarDigital Library
- M. E. J. Newman, C. Moore, and D. J. Watts. Mean-Field Solution of the Small-World Network Model. In Physical Review Letters, 84(14):3201--3204, April 2000.Google Scholar
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proceedings of the ACM SIGCOMM Conference on Data Communication, pages 161--172, San Diego, CA, USA, August 2001. Google ScholarDigital Library
- J. Travers and S. Milgram. An Experimental Study of the Small World Problem. In Sociometry, 32(4):425--443, 1969.Google Scholar
- B. Wong and E. G. Sirer. Approximate Matching for Peer-to-Peer Overlays with Cubit. In Computing and Information Science Technical Report, Cornell University, December 2008.Google Scholar
- B. Wong, A. Slivkins, and E. G. Sirer. Meridian: A Lightweight Network Location Service Without Virtual Coordinates. In Proceedings of the ACM SIGCOMM Conference on Data Communication, pages 85--96, Philadelphia, PA, USA, August 2005. Google ScholarDigital Library
- B. Wong, I. Stoyanov, and E. G. Sirer. Octant: A Comprehensive Framework for the Geolocalization of Internet Hosts. In Proceedings of the Symposium on Networked System Design and Implementation, pages 313--326, Cambridge, MA, USA, April 2007. Google ScholarDigital Library
- D. J. Watts and S. H. Strogatz. Collective Dynamics of 'Small-World' Networks. In Nature, 393:440--442, June 1998.Google ScholarCross Ref
- H. Zhang, A. Goel, and R. Govindan. Using the Small-World Model to Improve Freenet Performance. In Proceedings of the IEEE International Conference on Computer Communications, pages 1228--1237, New York, NY, USA, June 2002.Google ScholarDigital Library
Index Terms
- Small-world datacenters
Recommendations
Invulnerability analysis of scale-free network and small-world network
AI2A '23: Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and AlgorithmsThis paper analyzes the invulnerability of two kinds of networks with different degrees of distribution. According to their topology, four attack strategies and two metrics were selected. The most effective attack strategy and the most appropriate ...
A Self-Stabilization Process for Small-World Networks
IPDPS '12: Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing SymposiumSmall-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to ...
A Virtual Ring Method for Building Small-World Structured P2P Overlays
This paper presents a general virtual ring method to design and analyze small-world structured P2P networks on the base topologies embedded in ID spaces with distance metric. Its basic idea is to abstract a virtual ring from the base topology according ...
Comments