Abstract
Software Defined Networking (SDN) is an emerging network architecture that separates the control plane from the data plane to simplify and improve network management with a high degree of flexibility. Network optimization under traffic uncertainties is one of the most challenging topics in communication networks to optimize network performance and traffic delivery. Although the traffic optimization technology has been extensively studied in the industry, a traffic optimization solution different from the traditional network is needed in the SDN network, which can utilize global network information and traffic characteristics to control and manage traffic in a better way. In this paper, a Mixed Linear Geometric Programming Traffic Optimization Algorithm (MLGP-TOA) is proposed for the problem of traffic uncertainties in SDN. Aiming at minimizing the maximum link utilization (MLU), the initial problem is transformed into a convex optimization problem by monomial approximation and variable substitution. Then, the inner point method is used to find the global optimal solution, and the optimal split ratio at each node is obtained. Finally, the configuration information is sent to the data plane. The simulation results show that the algorithm can reduce MLU, so that the traffic can fully utilize network resources and avoid congestion.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Netze, H.: Overview and principles of internet traffic engineering. RFC 121(6), 239–242 (2002)
Nunes, B.A.A., Mendonca, M., Nguyen, X.N., et al.: A survey of software-defined networking: past, present, and future of programmable networks. IEEE Commun. Surv. Tutor. 16(3), 1617–1634 (2014)
Mckeown, N., Anderson, T., Balakrishnan, H., et al.: OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Comput. Commun. Rev. 38(2), 69–74 (2008)
Egilmez, H.E., Tekalp, A.M.: Distributed QoS architectures for multimedia streaming over software defined networks. IEEE Trans. Multimed. 16(6), 1597–1609 (2014)
Yan, J., Zhang, H., Shuai, Q., et al.: HiQoS: an SDN-based multipath QoS solution. China Commun. 12(5), 123–133 (2015)
&Lt C E H, Edu&Gt C.: Analysis of an Equal-Cost Multipath Algorithm. RFC Editor (2000)
Zhou, J., Tewari, M., Zhu, M., et al.: WCMP: weighted cost multi-pathing for improved fairness in data centers. In: European Conference on Computer Systems. ACM (2014)
Alizadeh, M., Edsall, T., Dharmapurikar, S., et al.: CONGA: distributed congestion-aware load balancing for datacenters. ACM SIGCOMM Comput. Commun. Rev. 44(4), 503–514 (2015)
Al-Fares, M., Radhakrishnan, S., Raghavan, B., et al.: Hedera: dynamic flow scheduling for data center networks. In: Proceedings of the 7th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2010, San Jose, CA, USA, 28–30 April. DBLP (2010)
Handigol, N., Flajslik, M., Seetharaman, S., et al.: Aster* x: load-balancing as a network primitive. In: Proceedings of the 9th GENI Engineering Conference (Plenary), pp. 1–2 (2013)
Agarwal, S., Kodialam, M., Lakshman, T.V.: Traffic engineering in software defined networks. In: 2013 Proceedings of the IEEE INFOCOM (2013)
Bai, W., Chen, L., Chen, K., et al.: PIAS: practical information-agnostic flow scheduling for commodity data centers. IEEE/ACM Trans. Netw. 25(4), 1954–1967 (2017)
Awduche, D., Berger, L., Gan, D., et al.: RSVP-TE: Extensions to RSVP for LSP Tunnels. Ietf RFC (2001)
Chiesa, M., Rétvári, G., Schapira, M.: Oblivious routing in IP networks. IEEE/ACM Trans. Netw. 26(3), 1292–1305 (2018)
Altin, A., Fortz, B., Ümit, H.: Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks 60(2), 132–139 (2012)
Vissicchio, S., Vanbever, L., Rexford, J.: Sweet little lies: fake topologies for flexible routing. In: ACM Workshop on Hot Topics in Networks (2014)
Acknowledgement
This work is supported by National Key R&D Program of China No. 2018YFB1201500, National Natural Science Foundation of China under Grant No. 61871046, and Beijing Natural Science Foundation under granted No. L171011.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Teng, J., Hu, Y., Zhang, Y., Chen, M. (2019). Network Optimization Under Traffic Uncertainties Based on SDN. In: Milošević, D., Tang, Y., Zu, Q. (eds) Human Centered Computing. HCC 2019. Lecture Notes in Computer Science(), vol 11956. Springer, Cham. https://doi.org/10.1007/978-3-030-37429-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-030-37429-7_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-37428-0
Online ISBN: 978-3-030-37429-7
eBook Packages: Computer ScienceComputer Science (R0)