Abstract
Server-centric data center architecture has been proposed to provide high throughput, scalable construction and error tolerance with commodity servers and switches for cloud data centers. To fully utilize those advantages of server-centric data center, an effective routing algorithm to find high quality multiple paths in Server-centric network is needed. However, current routing algorithms cannot achieve this completely: (1) the state-of-art routing algorithms in server-centric data center just consider hop count when selecting paths; (2) traditional multi-constraint QoS routing algorithms only find one feasible path and are usually switch-oriented; (3) present multi-path algorithms cannot guarantee the performance of the founded paths. In this paper, we propose a multi-constrained routing algorithm for server-centric data centers, named Server-Centric Multi-Constrained Routing Algorithm (SCRAT). This algorithm exploits the topology features of the Server-Centric data center to decrease the algorithm complexity and returns optimal and feasible paths simultaneously. In simulations, SCRAT has a very high probability (more than 96 %) to find the exact optimal path, and the cost of the optimal path found in SCRAT is about 10 % less compared with path found in previous TS_MCOP. Compared with previous MPTCP, SCRAT reduces the path delay by 18 % less and increase the bandwidth by 20 %.
This paper is supported by the 863 plan (2013AA013501), the National Science and Technology Major Project (no. 2013ZX03002003-004), the NSFC (61272459, 61221063, 61170245), Research Plan in Shaanxi Province of China (2013K06-38), the Fundamental Research Funds for Central Universities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Porter, G., Strong, R., Farrington, N., Forencich, A., Chen-Sun, P., Rosing, T., Fainman, Y., Papen, G., Vahdat, A.: Integrating microsecond circuit switching into the data center. In: SIGCOMM, pp. 447–458 (2013)
Jain, S., Kumar, A., Mandal, S., et al.: B4: experience with a globally-deployed software defined WAN. In: SIGCOMM (2013)
Benson, T., Anand, A., Akella, A., Zhang, M.: Understanding data center traffic characteristics. SIGCOMM Coput. Commun. Rev. 40, 92–99 (2010)
Greenberg, A., Jain, N., et al.: VL2: a scalable and flexible data center network. In: ACM SIGCOMM (2009)
Guo, C., Lu, G., et al.: BCube: a high performance, server-centric network architecture for modular data centers. In: ACM SIGCOMM Conference (2009)
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., Lu, S.: DCell: a scalable and fault-tolerant network structure for data centers. In: ACM SIGCOMM Conference - SIGCOMM (2008)
Kuipers, F., Mieghem, P.V., et al.: An overview of constraint-based path selection algorithms for QoS routing. IEEECommun. Mag. 40, 50–55 (2002)
Reinhardt, L.B., Pisinger, D.: Multi-objective and multi-constrained non-additive shortest path. Comput. Oper. Res. CoR 38(3), 605–616 (2011)
Neve, H.D., Mieghem, P.V.: TAMCRA: a tunable accuracy multiple constraints routing algorithm. Comput. Commun. 23, 667–679 (2002)
Bari, M.F., Boutaba, R., et al.: Data center network virtualization: a survey. IEEE Commun. Surv. Tutor. 15, 909–928 (2012)
Raiciu, C., Barre, S., Pluntke, C., Greenhalgh, A., Wischik, D., Handley, M.: Improving datacenter performance and robustness with multipath TCP. In: ACM SIGCOMM (2011)
Mudigonda, J., Yalagandula, P., AI-Fares, M., Mogul, J.C.: SPAIN: COTS data-center ethernet for multipathing over arbitrary topologies. In: NSDI (2010)
Jaffe, J.M.: Algorithms for finding paths with multiple constraints. Networks 14, 95–116 (1984)
Dai, F., Liu, A.: A multi-constrained quality of service routing algorithm based on vector converting. In: WiCom (2009)
Chen, K., Hu, C., Zhang, X., Zheng, K.: Survey on routing in data centers: insights and future directions. IEEE Netw. 25, 6–10 (2011)
Mieghem, P.V., Kuipers, F.: Concepts of exact QoS routing algorithms. IEEE/ACM Trans. Netw. 12, 851–864 (2004)
Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: Proceedings of IEEE INFOCOM 2001. IEEE Computer and Communications Societies, Alaska (2001)
Wang, S., Wang, H., Li, L.: An enhanced algorithm for multiple constraints optimal path calculation. In: International Conference on Communications, Circuits and Systems - ICCCAS (2004)
Puri, A., Tripakis, S.: Algorithms for the multi-constrained routing problem. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 338–347. Springer, Heidelberg (2002)
Fang, Q., Han, J., Mao, L., Li, Z.: Exact and heuristic algorithm for multi-constrained optimal path problem. In: DAS (2011)
Fu, Y., Cheng, X., Tang, Y.: Optimization theory and method. Press of UESTC, Chengdu (1996)
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
Qian, K., Wang, H., Hu, C., Zhang, C., Zhou, Y. (2015). Multi-Constrained Multi-Path Routing for Server-Centric Data Center 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_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-46826-5_1
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)
