Abstract
Software defined networking (SDN) has emerged as an efficient network technology for lowering operating cost through simplified hardware, software and management. Specific research focus has been placed to achieve a successful carrier grade network with SDN, in terms of scalability, reliability, QoS and service management. In this paper, graph theory and traffic engineering are used to model the network state transitions and path assignment problem at first. Next, we present a quantitative assessment model on path assignment for a centralized controller to assess different kinds of path assignments, considering optimal path utilization, network load balance, network load volatility, and resource utilization simultaneously. In the end, an example forquantitatively assessing existing different path assignments is detailed to illustrate our proposed model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bari M F, Roy A R, Chowdhury S R, et al. Dynamic controller provisioning in software defined networks [C] // 2013 9th International Conference on Network and Service Management (CNSM). Washington D C: IEEE Press, 2013: 18–25.
Gude N, Koponen T, Pettit J, et al. NOX: towards an operating system for networks [J]. ACM SIGCOMM Computer Communication Review, 2008, 38(3): 105–110.
Trivisonno R, Vaishnavi I, Guerzoni R, et al. Virtual links mapping in future SDN-enabled networks [C] // 2013 IEEE SDN for Future Networks and Services (SDN4FNS). Washington D C: IEEE Press, 2013: 1–5.
Kanagavelu R, Mingjie L N, Mi K M, et al. OpenFlow based control for re-routing with differentiated flows in data center networks [C] // 2012 18th IEEE International Conference on Networks (ICON). Washington D C: IEEE Press, 2012: 228–233.
Jin H, Pan D, Liu J, et al. Openflow-based flow-level bandwidth provisioning for cicqswitches [J]. IEEE Transactions on Computers, 2013, 62(9): 1799–1812.
Handigol N, Seetharaman S, Flajslik M, et al. Plug-n-Serve: Load-balancing web traffic using OpenFlow [J]. ACM SigcommDemo, 2009, 4(5): 6.
Giorgetti A, Cugini F, Paolucci F, et al. OpenFlow and PCE architectures in wavelength switched optical networks [C] // 2012 16th International Conference on Optical Network Design and Modeling (ONDM). Washington D C: IEEE Press, 2012: 1–6.
Egilmez H E, Dane S T, Bagci K T, et al. OpenQoS: An OpenFlow controller design for multimedia delivery with end-to-end quality of service over software-defined networks [C] // Signal & Information Processing Association Annual Summit and Conference (APSIPA ASC), 2012 Asia-Pacific. Washington D C: IEEE Press, 2012: 1–8.
Ramos R M, Martinello M, Esteve Rothenberg C. Slickflow: Resilient source routing in data center networks unlocked by openflow [C] // 2013 IEEE 38th Conference on Local Computer Networks (LCN). Washington D C: IEEE Press, 2013: 606–613.
Lee S S W, Li K Y, Chan K Y, et al. Path layout planning and software based fast failure detection in survivable OpenFlow networks [C] // 2014 10th International Conference on the Design of Reliable Communication Networks (DRCN). Washington D C: IEEE Press, 2014: 1–8.
Cohen R, Lewin-Eytan L, Naor J S, et al. On the effect of forwarding table size on SDN network utilization [C] // INFOCOM, 2014 Proceedings IEEE. Washington D C: IEEE, 2014: 1734–1742.
Malboubi M, Wang L, Chuah C N, et al. Intelligent SDN based traffic (de) aggregation and measurement paradigm (istamp) [C] // INFOCOM, 2014 Proceedings IEEE. Washington D C: IEEE Press, 2014: 934–942.
Oki E, Inoue I, Shiomoto K. Path computation element (PCE)-based traffic engineering in MPLS and GMPLS networks [C] // Sarnoff Symposium, 2007 IEEE. Washington D C: IEEE Press, 2007: 1–5.
Banerjee G, Sidhu D. Comparative analysis of path computation techniques for MPLS traffic engineering [J]. Computer Networks, 2002, 40(1): 149–165.
Beker S, Puech N, Friderikos V. A Tabu search heuristic for the offline MPLS reduced complexity layout design problem [C] // Networking 2004. Berlin, Heidelberg: Springer-Verlag, 2004: 514–525.
Sezer S, Scott-Hayward S, Chouhan P K, et al. Are we ready for SDN? Implementation challenges for software-defined networks [J]. Communications Magazine, 2013,51(7): 36–43.
Li J, Chang X, Ren Y, et al. An effective path load balancing mechanism based on SDN [C] // 2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). Washington D C: IEEE Press, 2014: 527–533.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (61373040, 61173137), the Ph.D. Programs Foundation of Ministry of Education of China (20120141110002), and the Key Project of Natural Science Foundation of Hubei Province (2010CDA004)
Rights and permissions
About this article
Cite this article
Wang, X., Huang, C., Shi, J. et al. Quantitative assessment model on path assignment for SDNs. Wuhan Univ. J. Nat. Sci. 21, 387–393 (2016). https://doi.org/10.1007/s11859-016-1185-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11859-016-1185-2