Abstract
Scalability and fault tolerance become a fundamental challenge of data center network structure due to the explosive growth of data. Both structures proposed in the area of parallel computing and structures based on tree hierarchy are not able to satisfy these two demands. In this paper, we propose Totoro, a scalable and fault-tolerant network to handle the challenges by using backup built-in Ethernet ports. We connect a bunch of servers to an intra-switch to form a basic partition. Then we utilize half of backup ports to connect those basic partitions with inter-switches to build a larger partition. Totoro is hierarchically and recursively defined and the high-level Totoro is constructed by many low-level Totoros. Totoro can scale to millions of nodes. We also design a fault-tolerant routing protocol. Its capability is very close to the performance bound. Our experiments show that Totoro is a viable interconnection structure for data centers.
Chapter PDF
Similar content being viewed by others
References
Statistics-YouTube, http://www.youtube.com/t/press_statistics
A Typical Day In the Internet, http://www.mbaonline.com
Gantz, J.F., Chute, C.: The diverse and exploding digital universe: An updated forecast of worldwide information growth through 2011. In: IDC (2008)
Ten worst cloud crashes in 2011, http://www.ctocio.com/hotnews/2370.html
Dean, J.: Experiences with MapReduce, an abstraction for large-scale computation. In: PACT: 15th International Conference on Parallel Architectures and Compilation Techniques, vol. 16(20), p. 1. ACM (2006)
Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. ACM SIGCOMM Computer Communication Review 38(4), 63–74 (2008)
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., Lu, S.: Dell: a scalable and fault-tolerant network structure for data centers. ACM SIGCOMM Computer Communication Review 38(4), 75–86 (2008)
Li, D., Guo, C., Wu, H., Tan, K., Zhang, Y., Lu, S.: FiConn: Using backup port for server interconnection in data centers. In: IEEE INFOCOM 2009, pp. 2276-2285. IEEE (2009)
Niranjan Mysore, R., Pamboris, A., Farrington, N., Huang, N., Miri, P., Radhakrishnan, S., Vahdat, A.: PortLand: a scalable fault-tolerant layer 2 data center network fabric. ACM SIGCOMM Computer Communication Review 39(4), 39–50 (2009)
Greenberg, A., Hamilton, J.R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Sengupta, S.: VL2: a scalable and flexible data center network. ACM SIGCOMM Computer Communication Review 39(4), 51–62 (2009)
Costa, P., Donnelly, A., O’shea, G., Rowstron, A.: CamCube: a key-based data center. Technical Report MSR TR-2010-74, Microsoft Research (2010)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)
Floyd, R.W.: Algorithm 97: shortest path. Communications of the ACM 5(6), 345 (1962)
Deng, Y.: RISC: A resilient interconnection network for scalable cluster storage systems. Journal of Systems Architecture 54(1), 70–80 (2008)
Parhami, B.: Introduction to parallel processing: algorithms and architectures. Series in Computer Science, vol. 1. Springer, Heidelberg (2006)
Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 395–406. ACM (2003)
Barroso, L.A., Dean, J., Holzle, U.: Web search for a planet: The Google cluster architecture. Micro IEEE 23(2), 22–28 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Xie, J., Deng, Y., Zhou, K. (2013). Totoro: A Scalable and Fault-Tolerant Data Center Network by Using Backup Port. In: Hsu, CH., Li, X., Shi, X., Zheng, R. (eds) Network and Parallel Computing. NPC 2013. Lecture Notes in Computer Science, vol 8147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40820-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-40820-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40819-9
Online ISBN: 978-3-642-40820-5
eBook Packages: Computer ScienceComputer Science (R0)