Abstract
A number of new Clos data center networking fabrics have been proposed recently by using commodity off-the-shelf hardware. In Clos networks, randomized routing is typically used to achieve load balance. However, with typical communication patterns, pure randomized routing design cannot fully exploit bandwidth provided by Clos topologies. This paper strives to evaluate the performance of both randomized routing and its alternatives. As an incremental improvement, periodic path renewal is discussed first. We then discuss adaptive routing, together with its implementation consideration and costs. To reduce overhead of pure adaptive routing, a mixed routing scheme is also discussed. Through detailed discussions and comprehensive evaluations, we provide designers with useful insight and a range of options for configuring the routing scheme.
Yi Wang—This work is partially supported by “National Natural Science Foundation of China (No. 61202107, No. 61100220, No. 61202303)”, by “National High Technology Research and Development Program of China (863 Program No. 2014AA01A702)”, by “Natural Science Foundation of Hubei Province (No. 2014CFB1007), and by “National Key Technology Research and Development Program of China (No. 2012BAH46F03)”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. In: ACM SIGCOMM Computer Communication Review, vol. 38, pp. 63–74. ACM (2008)
Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., Vahdat, A.: Hedera: dynamic flow scheduling for data center networks. In: NSDI, vol. 10, pp. 19–19 (2010)
Alizadeh, M., Greenberg, A., Maltz, D.A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., Sridharan, M.: Data center TCP (DCTCP). ACM SIGCOMM Comput. Commun. Rev. 41(4), 63–74 (2010)
Aydogan, Y., Stunkel, C.B., Aykanat, C., Abali, B.: Adaptive source routing in multistage interconnection networks. In: Proceedings of the 10th International Parallel Processing Symposium, 1996, IPPS’96, pp. 258–267. IEEE (1996)
Clos, C.: A study of non-blocking switching networks. Bell Syst. Tech. J. 32(2), 406–424 (1953)
Dally, W.J., Towles, B.P.: Principles and Practices of Interconnection Networks. Elsevier, San Mateo (2004)
Geoffray, P., Hoefler, T.: Adaptive routing strategies for modern high performance networks. In: 16th IEEE Symposium on High Performance Interconnects, 2008, HOTI’08, pp. 165–172. IEEE (2008)
Greenberg, A., Hamilton, J.R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D.A., Patel, P., Sengupta, S.: VL2: a scalable and flexible data center network. ACM SIGCOMM Comput. Commun. Rev. 39, 51–62 (2009). ACM
Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., Lu, S.: Bcube: a high performance, server-centric network architecture for modular data centers. ACM SIGCOMM Comput. Commun. Rev. 39(4), 63–74 (2009)
Kim, J., Dally, W.J., Dally, J., Abts, D.: Adaptive routing in high-radix clos network. In: SC 2006 Conference, Proceedings of the ACM/IEEE, pp. 7–7. IEEE (2006)
Leiserson, C.E.: Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. 100(10), 892–901 (1985)
Soule, A., Salamatia, K., Taft, N., Emilion, R., Papagiannaki, K.: Flow classification by histograms: or how to go on safari in the internet. ACM SIGMETRICS Perform. Eval. Rev. 32(1), 49–60 (2004)
Tian, C., Alimi, R., Yang, Y.R., Zhang, D.: Shadowstream: performance evaluation as a capability in production internet live streaming networks. In: Proceedings of the ACM SIGCOMM 2012 conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 347–358. ACM (2012)
Tian, C., Jiang, H., Iyengar, A., Liu, X., Wu, Z., Chen, J., Liu, W., Wang, C.: Improving application placement for cluster-based web applications. IEEE Trans. Netw. Service Manage. 8(2), 104–115 (2011)
Tian, C., Jiang, H., Liu, X., Liu, W.: Revisiting dynamic query protocols in unstructured peer-to-peer networks. IEEE Trans. Parallel Distrib. Syst. 23(1), 160–167 (2012)
Tian, C., Jiang, H., Wang, C., Wu, Z., Chen, J., Liu, W.: Neither shortest path nor dominating set: aggregation scheduling by greedy growing tree in multihop wireless sensor networks. IEEE Trans. Veh. Technol. 60(7), 3462–3472 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Tian, C., Wang, S., Liu, W. (2015). Performance Evaluation of Routing Schemes in Data Center Clos Networks. In: Zhang, S., Xu, K., Xu, M., Wu, J., Wu, C., Zhong, Y. (eds) Frontiers in Internet Technologies. ICoC 2014. Communications in Computer and Information Science, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46826-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-46826-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46825-8
Online ISBN: 978-3-662-46826-5
eBook Packages: Computer ScienceComputer Science (R0)