RO-RO: Routing Optimality - Reconfiguration Overhead Balance in Software-Defined ISP Networks
Software-defined networking provides a promising solution for traffic engineering (TE) by utilizing a centralized controller to remotely configure programmable network switches. In order to achieve optimal traffic distribution and meet the Quality of Service (QoS) requirements, the SDN controller mu...
Gespeichert in:
Veröffentlicht in: | IEEE journal on selected areas in communications 2019-05, Vol.37 (5), p.997-1011 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1011 |
---|---|
container_issue | 5 |
container_start_page | 997 |
container_title | IEEE journal on selected areas in communications |
container_volume | 37 |
creator | Tomovic, Slavica Radusinovic, Igor |
description | Software-defined networking provides a promising solution for traffic engineering (TE) by utilizing a centralized controller to remotely configure programmable network switches. In order to achieve optimal traffic distribution and meet the Quality of Service (QoS) requirements, the SDN controller must frequently solve complex optimization models. Applying an optimization model in ISP (Internet Service Provider) networks implies abundant routing reconfigurations, which adversely impact the network stability and QoS parameters. Namely, since routing updates usually cannot be applied on all switches at the same time, transient congestion and loops often happen as a result. Here, in this paper, we propose a new control framework that strives to maximize the network throughput and provide QoS with minimal reconfiguration costs. 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 propose a multi-objective optimization model which jointly minimizes the routing cost function and the reconfiguration overhead. The Pareto frontier of the optimization model is generated by the augmented \epsilon -constrained method, whereas a Lyapunov drift-plus-penalty function is used to select the best compromise solution from the Pareto set. Since the reconfiguration overhead is reduced, the network controller could be allowed to optimize resource allocation more frequently, in order to respond quickly and efficiently to the network changes. Considering that the proposed optimization model is computationally intractable in large-scale networks, we also propose a heuristic algorithm to efficiently solve large instances of the problem. In simulations and Mininet experiments, we show that our solution brings performance improvement over the conventional periodic TE techniques. Moreover, the proposed heuristic achieves better QoS request acceptance ratio than the state-of-the-art multi-objective optimization solution, despite the significantly reduced computational complexity. |
doi_str_mv | 10.1109/JSAC.2019.2906762 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_8672627</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8672627</ieee_id><sourcerecordid>2211109061</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-99e2b322f322dcb977d049991a6f4293005f9dfad4de836000f654ba4850c3353</originalsourceid><addsrcrecordid>eNo9kMtOwzAQRS0EEqXwAYiNJdYufiROzA7Kq6giKIUlstxkXFJKXByHqn9PolYsRrM5d0b3IHTO6Igxqq6eZzfjEadMjbiiMpH8AA1YHKeEUpoeogFNhCBpwuQxOmmaJaUsilI-QB95RvLsGueuDVW9wNk6VN9mVYUtJjiHwtW2WrTehMrVOPsF_wmmxLdmZeoCcFXjmbNhYzyQO7BVDSWezF7xC4SN81_NKTqyZtXA2X4P0fvD_dv4iUyzx8n4ZkoKrkQgSgGfC85tN2UxV0lS0kgpxYy0UUdQGltVWlNGJaRCdpWsjKO5idKYFkLEYogud3fX3v200AS9dK2vu5eac9YLopJ1FNtRhXdN48Hqte_K-q1mVPeQ7i3q3qLeW-wyF7tMBQD_fCoTLnki_gDKNGw0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2211109061</pqid></control><display><type>article</type><title>RO-RO: Routing Optimality - Reconfiguration Overhead Balance in Software-Defined ISP Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Tomovic, Slavica ; Radusinovic, Igor</creator><creatorcontrib>Tomovic, Slavica ; Radusinovic, Igor</creatorcontrib><description>Software-defined networking provides a promising solution for traffic engineering (TE) by utilizing a centralized controller to remotely configure programmable network switches. In order to achieve optimal traffic distribution and meet the Quality of Service (QoS) requirements, the SDN controller must frequently solve complex optimization models. Applying an optimization model in ISP (Internet Service Provider) networks implies abundant routing reconfigurations, which adversely impact the network stability and QoS parameters. Namely, since routing updates usually cannot be applied on all switches at the same time, transient congestion and loops often happen as a result. Here, in this paper, we propose a new control framework that strives to maximize the network throughput and provide QoS with minimal reconfiguration costs. 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 propose a multi-objective optimization model which jointly minimizes the routing cost function and the reconfiguration overhead. The Pareto frontier of the optimization model is generated by the augmented <inline-formula> <tex-math notation="LaTeX">\epsilon </tex-math></inline-formula>-constrained method, whereas a Lyapunov drift-plus-penalty function is used to select the best compromise solution from the Pareto set. Since the reconfiguration overhead is reduced, the network controller could be allowed to optimize resource allocation more frequently, in order to respond quickly and efficiently to the network changes. Considering that the proposed optimization model is computationally intractable in large-scale networks, we also propose a heuristic algorithm to efficiently solve large instances of the problem. In simulations and Mininet experiments, we show that our solution brings performance improvement over the conventional periodic TE techniques. Moreover, the proposed heuristic achieves better QoS request acceptance ratio than the state-of-the-art multi-objective optimization solution, despite the significantly reduced computational complexity.</description><identifier>ISSN: 0733-8716</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/JSAC.2019.2906762</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Complexity ; Computer simulation ; Controllers ; Cost engineering ; Delays ; Heuristic algorithms ; Heuristic methods ; Internet service providers ; Multiple objective analysis ; Multiprotocol label switching ; Optimization ; Pareto optimization ; Penalty function ; Programmable controllers ; QoS ; Quality of service ; Quality of service architectures ; Reconfiguration ; Remote control ; Resource allocation ; Routing ; SDN ; Side effects ; Software-defined networking ; Stability analysis ; Switches ; Switching theory ; Traffic congestion ; Traffic control ; Traffic engineering</subject><ispartof>IEEE journal on selected areas in communications, 2019-05, Vol.37 (5), p.997-1011</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-99e2b322f322dcb977d049991a6f4293005f9dfad4de836000f654ba4850c3353</citedby><cites>FETCH-LOGICAL-c293t-99e2b322f322dcb977d049991a6f4293005f9dfad4de836000f654ba4850c3353</cites><orcidid>0000-0001-7942-8189 ; 0000-0003-0514-2158</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8672627$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,782,786,798,27931,27932,54765</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8672627$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Tomovic, Slavica</creatorcontrib><creatorcontrib>Radusinovic, Igor</creatorcontrib><title>RO-RO: Routing Optimality - Reconfiguration Overhead Balance in Software-Defined ISP Networks</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>Software-defined networking provides a promising solution for traffic engineering (TE) by utilizing a centralized controller to remotely configure programmable network switches. In order to achieve optimal traffic distribution and meet the Quality of Service (QoS) requirements, the SDN controller must frequently solve complex optimization models. Applying an optimization model in ISP (Internet Service Provider) networks implies abundant routing reconfigurations, which adversely impact the network stability and QoS parameters. Namely, since routing updates usually cannot be applied on all switches at the same time, transient congestion and loops often happen as a result. Here, in this paper, we propose a new control framework that strives to maximize the network throughput and provide QoS with minimal reconfiguration costs. 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 propose a multi-objective optimization model which jointly minimizes the routing cost function and the reconfiguration overhead. The Pareto frontier of the optimization model is generated by the augmented <inline-formula> <tex-math notation="LaTeX">\epsilon </tex-math></inline-formula>-constrained method, whereas a Lyapunov drift-plus-penalty function is used to select the best compromise solution from the Pareto set. Since the reconfiguration overhead is reduced, the network controller could be allowed to optimize resource allocation more frequently, in order to respond quickly and efficiently to the network changes. Considering that the proposed optimization model is computationally intractable in large-scale networks, we also propose a heuristic algorithm to efficiently solve large instances of the problem. In simulations and Mininet experiments, we show that our solution brings performance improvement over the conventional periodic TE techniques. Moreover, the proposed heuristic achieves better QoS request acceptance ratio than the state-of-the-art multi-objective optimization solution, despite the significantly reduced computational complexity.</description><subject>Algorithms</subject><subject>Complexity</subject><subject>Computer simulation</subject><subject>Controllers</subject><subject>Cost engineering</subject><subject>Delays</subject><subject>Heuristic algorithms</subject><subject>Heuristic methods</subject><subject>Internet service providers</subject><subject>Multiple objective analysis</subject><subject>Multiprotocol label switching</subject><subject>Optimization</subject><subject>Pareto optimization</subject><subject>Penalty function</subject><subject>Programmable controllers</subject><subject>QoS</subject><subject>Quality of service</subject><subject>Quality of service architectures</subject><subject>Reconfiguration</subject><subject>Remote control</subject><subject>Resource allocation</subject><subject>Routing</subject><subject>SDN</subject><subject>Side effects</subject><subject>Software-defined networking</subject><subject>Stability analysis</subject><subject>Switches</subject><subject>Switching theory</subject><subject>Traffic congestion</subject><subject>Traffic control</subject><subject>Traffic engineering</subject><issn>0733-8716</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMtOwzAQRS0EEqXwAYiNJdYufiROzA7Kq6giKIUlstxkXFJKXByHqn9PolYsRrM5d0b3IHTO6Igxqq6eZzfjEadMjbiiMpH8AA1YHKeEUpoeogFNhCBpwuQxOmmaJaUsilI-QB95RvLsGueuDVW9wNk6VN9mVYUtJjiHwtW2WrTehMrVOPsF_wmmxLdmZeoCcFXjmbNhYzyQO7BVDSWezF7xC4SN81_NKTqyZtXA2X4P0fvD_dv4iUyzx8n4ZkoKrkQgSgGfC85tN2UxV0lS0kgpxYy0UUdQGltVWlNGJaRCdpWsjKO5idKYFkLEYogud3fX3v200AS9dK2vu5eac9YLopJ1FNtRhXdN48Hqte_K-q1mVPeQ7i3q3qLeW-wyF7tMBQD_fCoTLnki_gDKNGw0</recordid><startdate>20190501</startdate><enddate>20190501</enddate><creator>Tomovic, Slavica</creator><creator>Radusinovic, Igor</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0001-7942-8189</orcidid><orcidid>https://orcid.org/0000-0003-0514-2158</orcidid></search><sort><creationdate>20190501</creationdate><title>RO-RO: Routing Optimality - Reconfiguration Overhead Balance in Software-Defined ISP Networks</title><author>Tomovic, Slavica ; Radusinovic, Igor</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-99e2b322f322dcb977d049991a6f4293005f9dfad4de836000f654ba4850c3353</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Complexity</topic><topic>Computer simulation</topic><topic>Controllers</topic><topic>Cost engineering</topic><topic>Delays</topic><topic>Heuristic algorithms</topic><topic>Heuristic methods</topic><topic>Internet service providers</topic><topic>Multiple objective analysis</topic><topic>Multiprotocol label switching</topic><topic>Optimization</topic><topic>Pareto optimization</topic><topic>Penalty function</topic><topic>Programmable controllers</topic><topic>QoS</topic><topic>Quality of service</topic><topic>Quality of service architectures</topic><topic>Reconfiguration</topic><topic>Remote control</topic><topic>Resource allocation</topic><topic>Routing</topic><topic>SDN</topic><topic>Side effects</topic><topic>Software-defined networking</topic><topic>Stability analysis</topic><topic>Switches</topic><topic>Switching theory</topic><topic>Traffic congestion</topic><topic>Traffic control</topic><topic>Traffic engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tomovic, Slavica</creatorcontrib><creatorcontrib>Radusinovic, Igor</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE journal on selected areas in communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Tomovic, Slavica</au><au>Radusinovic, Igor</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>RO-RO: Routing Optimality - Reconfiguration Overhead Balance in Software-Defined ISP Networks</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2019-05-01</date><risdate>2019</risdate><volume>37</volume><issue>5</issue><spage>997</spage><epage>1011</epage><pages>997-1011</pages><issn>0733-8716</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>Software-defined networking provides a promising solution for traffic engineering (TE) by utilizing a centralized controller to remotely configure programmable network switches. In order to achieve optimal traffic distribution and meet the Quality of Service (QoS) requirements, the SDN controller must frequently solve complex optimization models. Applying an optimization model in ISP (Internet Service Provider) networks implies abundant routing reconfigurations, which adversely impact the network stability and QoS parameters. Namely, since routing updates usually cannot be applied on all switches at the same time, transient congestion and loops often happen as a result. Here, in this paper, we propose a new control framework that strives to maximize the network throughput and provide QoS with minimal reconfiguration costs. 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 propose a multi-objective optimization model which jointly minimizes the routing cost function and the reconfiguration overhead. The Pareto frontier of the optimization model is generated by the augmented <inline-formula> <tex-math notation="LaTeX">\epsilon </tex-math></inline-formula>-constrained method, whereas a Lyapunov drift-plus-penalty function is used to select the best compromise solution from the Pareto set. Since the reconfiguration overhead is reduced, the network controller could be allowed to optimize resource allocation more frequently, in order to respond quickly and efficiently to the network changes. Considering that the proposed optimization model is computationally intractable in large-scale networks, we also propose a heuristic algorithm to efficiently solve large instances of the problem. In simulations and Mininet experiments, we show that our solution brings performance improvement over the conventional periodic TE techniques. Moreover, the proposed heuristic achieves better QoS request acceptance ratio than the state-of-the-art multi-objective optimization solution, despite the significantly reduced computational complexity.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSAC.2019.2906762</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0001-7942-8189</orcidid><orcidid>https://orcid.org/0000-0003-0514-2158</orcidid></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0733-8716 |
ispartof | IEEE journal on selected areas in communications, 2019-05, Vol.37 (5), p.997-1011 |
issn | 0733-8716 1558-0008 |
language | eng |
recordid | cdi_ieee_primary_8672627 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithms Complexity Computer simulation Controllers Cost engineering Delays Heuristic algorithms Heuristic methods Internet service providers Multiple objective analysis Multiprotocol label switching Optimization Pareto optimization Penalty function Programmable controllers QoS Quality of service Quality of service architectures Reconfiguration Remote control Resource allocation Routing SDN Side effects Software-defined networking Stability analysis Switches Switching theory Traffic congestion Traffic control Traffic engineering |
title | RO-RO: Routing Optimality - Reconfiguration Overhead Balance in Software-Defined ISP Networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-04T04%3A11%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=RO-RO:%20Routing%20Optimality%20-%20Reconfiguration%20Overhead%20Balance%20in%20Software-Defined%20ISP%20Networks&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Tomovic,%20Slavica&rft.date=2019-05-01&rft.volume=37&rft.issue=5&rft.spage=997&rft.epage=1011&rft.pages=997-1011&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/JSAC.2019.2906762&rft_dat=%3Cproquest_RIE%3E2211109061%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2211109061&rft_id=info:pmid/&rft_ieee_id=8672627&rfr_iscdi=true |