Algorithmic and Complexity Aspects of Path Computation in Multi-Layer Networks
Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and to additional operational costs. However, some routers are...
Saved in:
| Published in: | IEEE/ACM transactions on networking Vol. 26; no. 6; pp. 2787 - 2800 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.12.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) IEEE/ACM |
| Subjects: | |
| ISSN: | 1063-6692, 1558-2566 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and to additional operational costs. However, some routers are able to encapsulate, decapsulate, and convert protocols, and act as a liaison between these layers. A unified control plane would be useful to optimize the use of the network resources and to automate the routing configurations. Software-defined networking-based architectures offer an opportunity to design such a control plane. One of the most important problems to deal with in this design is the path computation process. Classical path computation algorithms cannot resolve the problem, as they do not take into account encapsulations and conversions of protocols. In this paper, we propose algorithms to solve this problem and study several cases. If there is no bandwidth constraint, we propose a polynomial algorithm that computes the optimal path. We also give lower and upper bounds on the optimal path length. On the other hand, we show that the problem is <inline-formula> <tex-math notation="LaTeX">\mathsf {NP} </tex-math></inline-formula>-hard if there is a bandwidth constraint (or other quality-of-service parameters), even if there is only two protocols and in a symmetric graph. We study the complexity and the scalability of our algorithms and evaluate their performances on real and random topologies. The results show that they are faster than the previous ones proposed in the literature. These algorithms can also have important applications in automatic tunneling. |
|---|---|
| AbstractList | Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and to additional operational costs. However, some routers are able to encapsulate, decapsulate, and convert protocols, and act as a liaison between these layers. A unified control plane would be useful to optimize the use of the network resources and to automate the routing configurations. Software-Defined Networking based architectures, offer an opportunity to design such a control plane. One of the most important problems to deal with in this design is the path computation process. Classical path computation algorithms cannot resolve the problem as they do not take into account encapsulations and conversions of protocols. In this paper, we propose algorithms to solve this problem, and we study several cases. If there is no bandwidth constraint, we propose a polynomial algorithm that compute the optimal path. We also give lower and upper bounds on the optimal path length. On the other hand, we show that the problem is NP-hard if there is a bandwidth constraint (or other Quality of Service parameters), even if there is only two protocols and in a symmetric graph. We study the complexity and the scalability of our algorithms and evaluate their performances on real and random topologies. The results show that they are faster than the previous ones proposed in the literature. These algorithms can also have important applications in automatic tunneling. Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and to additional operational costs. However, some routers are able to encapsulate, decapsulate, and convert protocols, and act as a liaison between these layers. A unified control plane would be useful to optimize the use of the network resources and to automate the routing configurations. Software-defined networking-based architectures offer an opportunity to design such a control plane. One of the most important problems to deal with in this design is the path computation process. Classical path computation algorithms cannot resolve the problem, as they do not take into account encapsulations and conversions of protocols. In this paper, we propose algorithms to solve this problem and study several cases. If there is no bandwidth constraint, we propose a polynomial algorithm that computes the optimal path. We also give lower and upper bounds on the optimal path length. On the other hand, we show that the problem is [Formula Omitted]-hard if there is a bandwidth constraint (or other quality-of-service parameters), even if there is only two protocols and in a symmetric graph. We study the complexity and the scalability of our algorithms and evaluate their performances on real and random topologies. The results show that they are faster than the previous ones proposed in the literature. These algorithms can also have important applications in automatic tunneling. Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and to additional operational costs. However, some routers are able to encapsulate, decapsulate, and convert protocols, and act as a liaison between these layers. A unified control plane would be useful to optimize the use of the network resources and to automate the routing configurations. Software-defined networking-based architectures offer an opportunity to design such a control plane. One of the most important problems to deal with in this design is the path computation process. Classical path computation algorithms cannot resolve the problem, as they do not take into account encapsulations and conversions of protocols. In this paper, we propose algorithms to solve this problem and study several cases. If there is no bandwidth constraint, we propose a polynomial algorithm that computes the optimal path. We also give lower and upper bounds on the optimal path length. On the other hand, we show that the problem is <inline-formula> <tex-math notation="LaTeX">\mathsf {NP} </tex-math></inline-formula>-hard if there is a bandwidth constraint (or other quality-of-service parameters), even if there is only two protocols and in a symmetric graph. We study the complexity and the scalability of our algorithms and evaluate their performances on real and random topologies. The results show that they are faster than the previous ones proposed in the literature. These algorithms can also have important applications in automatic tunneling. |
| Author | Cohen, Johanne Fergani, Nasreddine Lamali, Mohamed Lamine |
| Author_xml | – sequence: 1 givenname: Mohamed Lamine orcidid: 0000-0002-9307-7482 surname: Lamali fullname: Lamali, Mohamed Lamine email: mohamed_lamine.lamali@u-bordeaux.fr organization: LaBRI, Université de Bordeaux, Talence, France – sequence: 2 givenname: Nasreddine surname: Fergani fullname: Fergani, Nasreddine organization: MathWorks, Cambridge, U.K – sequence: 3 givenname: Johanne surname: Cohen fullname: Cohen, Johanne email: johanne.cohen@lri.fr organization: LRI, Université Paris-Sud, CNRS, Université Paris-Saclay, Orsay, France |
| BackLink | https://hal.science/hal-01706362$$DView record in HAL |
| BookMark | eNp9kLtOAzEQRS0EEiHwAYhmJSqKDX6sX2UU8ZJCoAi15Tg2cdisg-0A-Xs2LFBQUM1o5tzRnXsE9pvQWABOERwgBOXldHI1HWCIxAALLhAke6CHKBUlpozttz1kpGRM4kNwlNISQkQgZj0wGdbPIfq8WHlT6GZejMJqXdsPn7fFMK2tyakIrnjUefG12mSdfWgK3xT3mzr7cqy3NhYTm99DfEnH4MDpOtmT79oHT9dX09FtOX64uRsNx6UhHOZSWEEMNLwSVCDJKOfzGTNVRSiSxM0xcrxyTlTMcWKsdozRajaTjlCNuKMz0gcX3d2FrtU6-pWOWxW0V7fDsdrNIOLtxwy_4ZY979h1DK8bm7Jahk1sWnsKIyoklkTKluIdZWJIKVqnjO9-zVH7WiGodkGrXdBqF7T6DrpVoj_KH0P_ac46jbfW_vKCEowIJ5_kKIm0 |
| CODEN | IEANEP |
| CitedBy_id | crossref_primary_10_1007_s42979_020_00319_4 crossref_primary_10_1016_j_jnca_2024_103929 crossref_primary_10_1109_TNET_2024_3378717 crossref_primary_10_1109_ACCESS_2021_3051984 |
| Cites_doi | 10.1109/49.510914 10.17487/rfc4655 10.1007/s00493-004-0002-2 10.1109/49.536364 10.17487/rfc6144 10.1126/science.286.5439.509 10.1016/j.future.2008.07.002 10.1109/INFCOM.2013.6567024 10.17487/rfc5659 10.1145/2656877.2656890 10.1145/637201.637237 10.1109/ICC.2008.1079 10.1109/TNET.2003.810310 10.1109/LCOMM.2014.2349991 10.1016/j.comcom.2008.09.026 10.1145/2491185.2491190 10.1364/OFC.2010.OTuG1 10.1016/j.comnet.2008.02.013 10.1016/j.comcom.2015.01.010 10.1016/j.comcom.2012.11.009 10.1109/TNET.2004.836112 10.1109/JLT.2012.2212179 10.1145/28869.28874 10.17487/rfc3985 10.1016/0020-0190(77)90002-3 10.1109/INFOCOM.2016.7524550 10.1007/978-3-642-01492-5_7 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D 1XC VOOES |
| DOI | 10.1109/TNET.2018.2878103 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1558-2566 |
| EndPage | 2800 |
| ExternalDocumentID | oai:HAL:hal-01706362v2 10_1109_TNET_2018_2878103 8532137 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: HÉRA project – fundername: Agence Nationale de la Recherche grantid: ANR-18-CE25-0002 funderid: 10.13039/501100001665 |
| GroupedDBID | -DZ -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 85S 8US 97E 9M8 AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABPPZ ABQJQ ABVLG ACGFS ACGOD ACIWK ACM ADBCU ADL AEBYY AEFXT AEJOY AENSD AETEA AETIX AFWIH AFWXC AGQYO AGSQL AHBIQ AI. AIBXA AIKLT AKJIK AKQYR AKRVB ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 D0L EBS EJD FEDTE GUFHI HF~ HGAVV HZ~ H~9 I07 ICLAB IEDLZ IES IFIPE IFJZH IPLJI JAVBF LAI LHSKQ M43 MVM O9- OCL P1C P2P PQQKQ RIA RIE RNS ROL TN5 UPT UQL VH1 XOL YR2 ZCA AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D 1XC VOOES |
| ID | FETCH-LOGICAL-c370t-8e83c0c74858196577db6c4435193fd21f74ff846f73ceaf6654bb9f35a17f5b3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000454237000027&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1063-6692 |
| IngestDate | Tue Oct 14 20:48:20 EDT 2025 Sun Nov 30 04:18:35 EST 2025 Sat Nov 29 03:05:22 EST 2025 Tue Nov 18 22:30:39 EST 2025 Wed Aug 27 02:53:56 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | Encapsulation Protocols Path computation Complexity theory automata theory multi-layer networks |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c370t-8e83c0c74858196577db6c4435193fd21f74ff846f73ceaf6654bb9f35a17f5b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-9307-7482 0000-0002-9548-5260 |
| OpenAccessLink | https://hal.science/hal-01706362 |
| PQID | 2158929399 |
| PQPubID | 32020 |
| PageCount | 14 |
| ParticipantIDs | hal_primary_oai_HAL_hal_01706362v2 crossref_citationtrail_10_1109_TNET_2018_2878103 ieee_primary_8532137 proquest_journals_2158929399 crossref_primary_10_1109_TNET_2018_2878103 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-12-01 |
| PublicationDateYYYYMMDD | 2018-12-01 |
| PublicationDate_xml | – month: 12 year: 2018 text: 2018-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE/ACM transactions on networking |
| PublicationTitleAbbrev | TNET |
| PublicationYear | 2018 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) IEEE/ACM |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) – name: IEEE/ACM |
| References | ref13 ref12 ref15 ref14 ref30 ref10 ref2 ref17 ref16 ref19 ref18 hopcroft (ref22) 2006 barabási (ref29) 1999; 286 ref24 ref23 ref26 ref25 ref20 martini (ref1) 2008 ref21 summerhill (ref27) 2006 ref28 ref8 ref7 ref9 ref4 ref3 kuipers (ref11) 2009; 32 ref6 ref5 |
| References_xml | – ident: ref17 doi: 10.1109/49.510914 – ident: ref14 doi: 10.17487/rfc4655 – ident: ref30 doi: 10.1007/s00493-004-0002-2 – ident: ref26 doi: 10.1109/49.536364 – ident: ref2 doi: 10.17487/rfc6144 – volume: 286 start-page: 509 year: 1999 ident: ref29 article-title: Emergence of scaling in random networks publication-title: Science doi: 10.1126/science.286.5439.509 – ident: ref16 doi: 10.1016/j.future.2008.07.002 – ident: ref8 doi: 10.1109/INFCOM.2013.6567024 – ident: ref15 doi: 10.17487/rfc5659 – year: 2008 ident: ref1 publication-title: Encapsulation Methods for Transport of Ethernet over MPLS Networks – year: 2006 ident: ref22 publication-title: Introduction to Automata Theory Languages and Computation – ident: ref5 doi: 10.1145/2656877.2656890 – ident: ref28 doi: 10.1145/637201.637237 – ident: ref19 doi: 10.1109/ICC.2008.1079 – ident: ref18 doi: 10.1109/TNET.2003.810310 – ident: ref9 doi: 10.1109/LCOMM.2014.2349991 – volume: 32 start-page: 78 year: 2009 ident: ref11 article-title: Path selection in multi-layer networks publication-title: Comput Commun doi: 10.1016/j.comcom.2008.09.026 – ident: ref4 doi: 10.1145/2491185.2491190 – ident: ref6 doi: 10.1364/OFC.2010.OTuG1 – ident: ref20 doi: 10.1016/j.comnet.2008.02.013 – ident: ref21 doi: 10.1016/j.comcom.2015.01.010 – ident: ref10 doi: 10.1016/j.comcom.2012.11.009 – ident: ref12 doi: 10.1109/TNET.2004.836112 – ident: ref7 doi: 10.1109/JLT.2012.2212179 – ident: ref25 doi: 10.1145/28869.28874 – ident: ref3 doi: 10.17487/rfc3985 – ident: ref23 doi: 10.1016/0020-0190(77)90002-3 – ident: ref13 doi: 10.1109/INFOCOM.2016.7524550 – year: 2006 ident: ref27 article-title: The new Internet2 network publication-title: Proc 6th Annu Global LambdaGrid Workshop – ident: ref24 doi: 10.1007/978-3-642-01492-5_7 |
| SSID | ssj0013026 |
| Score | 2.328971 |
| Snippet | Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage... |
| SourceID | hal proquest crossref ieee |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 2787 |
| SubjectTerms | Adaptation models Algorithms automata theory Bandwidth Complexity Complexity theory Computation Computational Complexity Computational modeling Computer Science Data Structures and Algorithms Encapsulation multi-layer networks Multilayers Networking and Internet Architecture Operating costs Optimization path computation Polynomials Protocol (computers) Protocols Quality of service Routers Software-defined networking Upper bounds |
| Title | Algorithmic and Complexity Aspects of Path Computation in Multi-Layer Networks |
| URI | https://ieeexplore.ieee.org/document/8532137 https://www.proquest.com/docview/2158929399 https://hal.science/hal-01706362 |
| Volume | 26 |
| WOSCitedRecordID | wos000454237000027&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2566 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0013026 issn: 1063-6692 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH5sw4Me_C3OXwTxJEbbpm3S4xDHDqPsMMFbadJEB9rJ1g38781LuykogrdSEgj92rzvNe99H8CVEHnksUhSTLxoaCk6FSZPaKiElnGsjJROMn_I01Q8PSWjFtyse2G01q74TN_ipTvLL6Zqgb_K7mxoCXzG29DmPK57tb5ODDxnrWYzHEbjOAmaE0zfS-7G6cMYi7jErU0PhL_yx2piUPsFKyCdtcqP_dgFmf7O_5a3C9sNmSS9Gv09aOlyH7a-SQweQNp7fZ7OJtXL20SRvCwIbgAogll9kJ5rs5yTqSEjSwRJ7fDgoCKTkrjeXDrMLSknaV0tPj-Ex_7D-H5AGw8Fqhj3Kiq0YMpTPBSRQPFAzgsZqzBEXz5misA3PDTGkhDDmdK5QTNiKRPDotznJpLsCDrltNTHQCw30yZnPChYFJrcMheVBNJYtIvYGM674K2eaqYagXH0uXjNXKLhJRkCkSEQWQNEF67XU95rdY2_Bl9aqNbjUBd70BtmeM-JANlQvAy6cIDArEc1mHThbIVs1nyk88yyHWHZoaVoJ7_POoVNXEBdvXIGnWq20OewoZbVZD67cO_fJ6OK1iE |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Na9wwEB3yUWh7SJqmIZuPVoSeSpXYlmzJxyUkbKhjcthCbsKSpWYh8ZZdJ5B_X43s3QRSArkZI4HwszVvrJn3AL5LWaURSzXFxItyT9GpdFVOuZFWZ5lxWgfJ_EKUpby-zq9W4OeyF8ZaG4rP7DFehrP8emru8VfZiQ8tSczEKqynnCdR1631dGYQBXM1n-MwmmV50p9hxlF-Mi7PxljGJY99giDjhUNWH4VWb7AGMpirvNiRQ5g533zbAj_BRk8nybDDfwtWbPMZPj4TGdyGcnj7ZzqbtDd3E0Oqpia4BaAMZvtIhqHRck6mjlx5Kkg6j4cAFpk0JHTn0qLytJyUXb34_Av8Pj8bn45o76JADRNRS6WVzERGcJlKlA8UotaZ4Ryd-Zirk9gJ7pynIU4wYyuHdsRa546lVSxcqtkOrDXTxu4C8ezMuoqJpGYpd5XnLiZPtPN415lzQgwgWjxVZXqJcXS6uFUh1YhyhUAoBEL1QAzgx3LK305f47XBRx6q5ThUxh4NC4X3ggyQD8YPyQC2EZjlqB6TARwskFX9ZzpXnu9Izw89Sdv7_6xv8H40vixUcVH-2ocPuJiuluUA1trZvT2Ed-ahncxnX8O7-A_wH9lo |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Algorithmic+and+complexity+aspects+of+path+computation+in+multi-layer+networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Lamali%2C+Mohamed+Lamine&rft.au=Fergani%2C+Nasreddine&rft.au=Cohen%2C+Johanne&rft.date=2018-12-01&rft.pub=IEEE%2FACM&rft.issn=1063-6692&rft.volume=26&rft.issue=6&rft.spage=2787&rft.epage=2800&rft_id=info:doi/10.1109%2FTNET.2018.2878103&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-01706362v2 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon |