Metrika članka

  • citati u SCindeksu: 0
  • citati u CrossRef-u:0
  • citati u Google Scholaru:[=>]
  • posete u poslednjih 30 dana:4
  • preuzimanja u poslednjih 30 dana:4
članak: 1 od 1  
Telfor Journal
2019, vol. 11, br. 1, str. 8-13
jezik rada: engleski
vrsta rada: neklasifikovan
doi:10.5937/telfor1901008T


Dynamic optimization of load-balancing and reconfiguration overhead in SD-ISP networks
(naslov ne postoji na srpskom)
University of Montenegro, Faculty of Electrical Engineering, Podgorica, Montenegro

e-adresa: slavicat@ucg.ac.me, igorr@ucg.ac.me

Sažetak

(ne postoji na srpskom)
In this paper, we propose a new traffic engineering (TE) approach for software-defined Internet Service Provider (SD-ISP) networks that strives to maximize the network throughput and provide adequate QoS (Quality of Service) with a minimal reconfiguration cost. In contrast to the conventional TE approaches, which perform the network optimizations periodically and control the side effects of reconfigurations by carefully choosing the period length between the optimization cycles, we use a bi-objective optimization model that minimizes maximum link utilization and the reconfiguration overhead. A new heuristic algorithm has been proposed in order to generate the approximated Pareto frontier for the bi-objective optimization model, while the Lyapunov drift-plus-penalty algorithm is used to select the most appropriate solution from the approximated Pareto set. Our simulation study shows that the proposed approach adjusts to the ISP's constraint on time-average reconfiguration rate by trading the throughput performance efficiently. Since the reconfiguration overhead is reduced, the network controller could be allowed to optimize resource allocation more frequently, in order to quickly and efficiently respond to the network changes. The paper analyses the impact of the reconfiguration rate constraint, average flow duration and the frequency of TE on the overall network performance.

Ključne reči

Reference

*** (2017) CPLEX Optimization Studio. [Online]. Available: http://www03.ibm.com/software/products/en/ibmilogcpleoptistud
*** The Internet Topology Zoo database. [Online]. Available: http://www.topology-zoo.org/dataset.html
Ashraf, U. (2017) Rule Minimization for Traffic Evolution in Software-Defined Networks. IEEE Communications Letters, 21(4): 793-796
Gunnar, A., Johansson, M., Telkamp, T. (2004) Traffic matrix estimation on a large IP backbone: A comparison on real data. u: The 4th ACM SIGCOMM, Taormina, Italy, Proceedings of, str. 149
He, J., Rexford, J. (2006) Date: Distributed adaptive traffic engineering. u: IEEE INFOCOMM, Proc
Hong, C.Y., Kandula, S., Mahajan, R., Zhang, M., Gill, V., Nanduri, M., Wattenhofer, R. (2013) Achieving high utilization with software-driven WAN. u: SIGCOMM '13, Proc. of, pp.15-26
Jain, S., et al. (2013) B4: Experience with a globally-deployed software defined WAN. u: ACM SIGCOMM, Proc. of, vol. 43, no. 4, pp. 3-14
Liu, H.H., Kandula, S., Mahajan, R., Zhang, M., Gelernter, D. (2014) Traffic engineering with forward fault correction. ACM SIGCOMM Computer Communication Review, 44(4): 527-538
Martins, L.J., Campos, N. (2016) Short-Sighted Routing, or When Less is More. IEEE Communications Magazine, 54(10): 82-88
Mendiola, A., Astorga, J., Jacob, E., Higuero, M. (2017) A Survey on the Contributions of Software-Defined Networking to Traffic Engineering. IEEE Communications Surveys & Tutorials, 19(2): 918-953
Moradi, M., Zhang, Y., Morley, M.Z., Manghirmalani, R. (2018) Dragon: Scalable, Flexible, and Efficient Traffic Engineering in Software Defined ISP Networks. IEEE Journal on Selected Areas in Communications, 36(12): 2744-2756
Neely, M.J. (2010) Stochastic Network Optimization with Application to Communication and Queueing Systems. Synthesis Lectures on Communication Networks, 3(1): 1-211
Ngatchou, P., Zarei, A., El-Sharkawi, A. (2005) Pareto Multi Objective Optimization. u: Proceedings of the 13th International Conference on, Intelligent Systems Application to Power Systems, IEEE, 84-91
Open Networking Foundation (2017) OpenFlow v1.4 specification. [Online]. Available: https://www.opennetworking.org/
Paris, S., Destounis, A., Maggi, L., Paschos, G.S., Leguay, J. (2016) Controlling flow reconfigurations in SDN. u: IEEE INFOCOM 2016: The 35th Annual IEEE International Conference on Computer Communications, San Francisco, CA, 1-9
Tomovic, S., Radusinovic, I. (2017) Traffic engineering approach to virtual-link provisioning in software-defined ISP networks. u: 2017 25th Telecommunication Forum (TELFOR), Institute of Electrical and Electronics Engineers (IEEE), str. 1-4
Tomovic, S., Radusinovic, I. (2018) Dynamic Optimization of Load-Balancing and Reconfiguration Overhead in SD-ISP Networks. u: 2018 26th Telecommunications Forum (TELFOR), Belgrade, 1-4
Tomovic, S., Radusinovic, I. (2016) Fast and efficient bandwidth-delay constrained routing algorithm for SDN networks. u: 2016 IEEE NetSoft Conference and Workshops (NetSoft), Institute of Electrical and Electronics Engineers (IEEE), str. 303-311
Tomović, S., Radusinović, I. (2019) An Effective Use of SDN for Virtual-Link Provisioning in ISP Networks. IEICE Transactions on Communications, E102.B(4): 855-864
Yen, J.Y. (1970) An algorithm for finding shortest routes from all source nodes to a given destination in general networks. Quarterly of Applied Mathematics, 27(4): 526-530