{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T10:03:14Z","timestamp":1753869794822,"version":"3.41.2"},"reference-count":43,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"content-version":"vor","delay-in-days":12,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int J Network Mgmt"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:title>ABSTRACT<\/jats:title><jats:p>Multitopology routing (MTR) provides an attractive alternative to segment routing (SR) for traffic engineering when network devices cannot be upgraded. However, due to a high overhead in terms of link state messages exchanged by topologies and the need to frequently update link weights to follow evolving network conditions, MTR is often limited to a small number of topologies and the satisfaction of loose QoS constraints. To overcome these limitations, we propose virtual MTR (vMTR), an MTR extension where demands are routed over virtual topologies that are silent; that is, they do not exchange LSA messages and that are continuously derived from a very limited set of real topologies, optimizing each QoS parameter. In this context, we present a polynomial and exact algorithm for vMTR and, as a benchmark, a local search algorithm for MTR. We show that vMTR helps to reduce drastically the number of real topologies and that it is more robust to QoS changes. In the case where SR can actually be rolled\u2010out, we also show that vMTR allows to drastically reduce SR overhead.<\/jats:p>","DOI":"10.1002\/nem.2321","type":"journal-article","created":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T04:20:44Z","timestamp":1736828444000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multitopology Routing With Virtual Topologies and Segment Routing"],"prefix":"10.1002","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6370-5735","authenticated-orcid":false,"given":"Nicolas","family":"Huin","sequence":"first","affiliation":[{"name":"IRISA UMR CNRS 6074 IMT Atlantique  Rennes France"}]},{"given":"S\u00e9bastien","family":"Martin","sequence":"additional","affiliation":[{"name":"Huawei Technologies Ltd., Paris Research Center  Paris France"}]},{"given":"J\u00e9r\u00e9mie","family":"Leguay","sequence":"additional","affiliation":[{"name":"Huawei Technologies Ltd., Paris Research Center  Paris France"}]}],"member":"311","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2008.4483669"},{"key":"e_1_2_10_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.3036826"},{"key":"e_1_2_10_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dcan.2022.02.006"},{"key":"e_1_2_10_5_1","doi-asserted-by":"crossref","unstructured":"P.Psenak S.Mirtorabi A.Roy L.Nguyen andP.Pillay\u2010Esnault \u201cMulti\u2010Topology (MT) Routing in OSPF \u201d tech. rep. IETF RRC 4915 (2007).","DOI":"10.17487\/rfc4915"},{"key":"e_1_2_10_6_1","doi-asserted-by":"crossref","unstructured":"T.Przygienda N.Shen andN.Sheth \u201cM\u2010ISIS: Multi Topology (MT) Routing in Intermediate System to Intermediate Systems (IS\u2010ISs) \u201d tech. rep. IETF RFC 5120 (2008).","DOI":"10.17487\/rfc5120"},{"key":"e_1_2_10_7_1","doi-asserted-by":"crossref","unstructured":"P.Psenak S.Hegde C.Filsfils K.Talaulikar andA.Gulko \u201cIGP Flexible Algorithm \u201d 9350. RFC (2023).","DOI":"10.17487\/RFC9350"},{"key":"e_1_2_10_8_1","doi-asserted-by":"crossref","unstructured":"N.Huin S.Martin J.Leguay andS.Cai \u201cNetwork Slicing With Multi\u2010Topology Routing \u201d in2021 IFIP Networking Conference (IFIP Networking)(IEEE 2021) 1\u20132.","DOI":"10.23919\/IFIPNetworking52078.2021.9472833"},{"key":"e_1_2_10_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2987866"},{"volume-title":"OSPF: Anatomy of an Internet Routing Protocol","year":"1998","author":"Moy J. T.","key":"e_1_2_10_10_1"},{"key":"e_1_2_10_11_1","first-page":"519","article-title":"Internet Traffic Engineering by Optimizing OSPF Weights","volume":"2","author":"Fortz B.","year":"2000","journal-title":"Proceedings IEEE INFOCOM"},{"key":"e_1_2_10_12_1","first-page":"859","article-title":"Lagrange Relaxation Based Method for the QOS Routing Problem","volume":"2","author":"Juttner A.","year":"2001","journal-title":"Proceedings IEEE INFOCOM"},{"key":"e_1_2_10_13_1","doi-asserted-by":"crossref","unstructured":"Y.Xiao K.Thulasiraman andG.Xue \u201cGEN\u2010LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints \u201d inInternational Symposium on Algorithms and Computation ISAAC'05(Springer 2005) 92\u2013105 https:\/\/doi.org\/10.1007\/11602613_11.","DOI":"10.1007\/11602613_11"},{"key":"e_1_2_10_14_1","doi-asserted-by":"crossref","unstructured":"A.Bley \u201cRouting and Capacity Optimization for IP Networks \u201d inOperations Research Proceedings 2007(2008) 9\u201316.","DOI":"10.1007\/978-3-540-77903-2_2"},{"key":"e_1_2_10_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"e_1_2_10_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014852026591"},{"key":"e_1_2_10_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20070"},{"key":"e_1_2_10_18_1","doi-asserted-by":"crossref","unstructured":"A.Benhamiche M.Chopin andS.Martin \u201cUnsplittable Shortest Path Routing: Extended Model and Matheuristic \u201d in2023 9th International Conference on Control Decision and Information Technologies (CoDIT)(2023):926\u2013931.","DOI":"10.1109\/CoDIT58514.2023.10284215"},{"key":"e_1_2_10_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SustainIT.2013.6685189"},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2013.02.006"},{"key":"e_1_2_10_21_1","first-page":"225","article-title":"Robust Optimization of OSPF\/IS\u2010IS Weights","volume":"20","author":"Fortz B.","year":"2003","journal-title":"Proc. INOC"},{"key":"e_1_2_10_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.bjp.2013.12.014"},{"key":"e_1_2_10_23_1","doi-asserted-by":"crossref","unstructured":"R. S.Ranaweera I. M.Kamrul andE.Oki \u201cPreventive Start\u2010Time Optimization of OSPF Link Weights Against Link Failure for Hose Model \u201d inAsia\u2010Pacific Conference on Communications (APCC)(IEEE 2012) 698\u2013702.","DOI":"10.1109\/APCC.2012.6388284"},{"key":"e_1_2_10_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21461"},{"key":"e_1_2_10_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316209"},{"key":"e_1_2_10_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2015.01.004"},{"key":"e_1_2_10_27_1","doi-asserted-by":"crossref","unstructured":"M.KodialamandT. V.Lakshman \u201cNetwork link Weight Setting: A Machine Learning Based Approach \u201d inProc. IEEE INFOCOM(2022) 2048\u20132057.","DOI":"10.1109\/INFOCOM48880.2022.9796922"},{"key":"e_1_2_10_28_1","first-page":"654","article-title":"Adaptive Multi\u2010Topology IGP Based Traffic Engineering With Near\u2010Optimal Network Performance","author":"Wang N.","year":"2008","journal-title":"IFIP Networking"},{"key":"e_1_2_10_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2012.6163600"},{"key":"e_1_2_10_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.05.008"},{"key":"e_1_2_10_31_1","doi-asserted-by":"crossref","unstructured":"X.Wang S.Wang andL.Li \u201cRobust Traffic Engineering Using Multi\u2010Topology Routing \u201d inGLOBECOM 2009\u20102009 IEEE Global Telecommunications Conference(IEEE 2009) 1\u20136.","DOI":"10.1109\/GLOCOM.2009.5426258"},{"key":"e_1_2_10_32_1","doi-asserted-by":"crossref","unstructured":"M.MenthandR.Martin \u201cNetwork Resilience Through Multi\u2010Topology Routing \u201d inDRCN(2005) 271\u2013277.","DOI":"10.1109\/DRCN.2005.1563878"},{"key":"e_1_2_10_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dcan.2022.02.006"},{"key":"e_1_2_10_34_1","doi-asserted-by":"crossref","unstructured":"A.Giorgetti P.Castoldi F.Cugini J.Nijhof F.Lazzeri andG.Bruno \u201cPath Encoding in Segment Routing \u201d inGLOBECOM(IEEE 2015) 1\u20136.","DOI":"10.1109\/GLOCOM.2015.7417097"},{"key":"e_1_2_10_35_1","doi-asserted-by":"crossref","unstructured":"J.\u2010R.Luttringer T.Alfroy P.M\u00e9rindol Q.Bramas F.Clad andC.Pelsser \u201cComputing Delay\u2010Constrained Least\u2010Cost Paths for Segment Routing Is Easier Than You Think \u201d in2020 IEEE 19th International Symposium on Network Computing and Applications (NCA)(IEEE 2020) 1\u20138.","DOI":"10.1109\/NCA51143.2020.9306706"},{"key":"e_1_2_10_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2018.03.003"},{"key":"e_1_2_10_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(99)00225-X"},{"issue":"2","key":"e_1_2_10_38_1","first-page":"63","article-title":"The Constrained Shortest Path Problem","volume":"2","author":"Ying X.","year":"2005","journal-title":"AKCE International Journal of Graphs and Combinatorics"},{"key":"e_1_2_10_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(83)90012-3"},{"key":"e_1_2_10_40_1","unstructured":"C.Filsfils D.Dukes S.Previdi J.Leddy S.Matsushima andD.Voyer \u201cIPv6 Segment Routing Header (SRH) \u201d 8754. RFC (2020) \u00a0https:\/\/www.rfc\u2010editor.org\/info\/rfc8754."},{"key":"e_1_2_10_41_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100403"},{"journal-title":"International Business Machines Corporation","article-title":"V12.6.3.0. 1: User's Manual for CPLEX","author":"Cplex","key":"e_1_2_10_42_1"},{"key":"e_1_2_10_43_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20371"},{"volume-title":"Loss\/Delay Instances for vIGP","year":"2024","author":"Huin N.","key":"e_1_2_10_44_1"}],"container-title":["International Journal of Network Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nem.2321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T00:02:09Z","timestamp":1737936129000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nem.2321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1002\/nem.2321"],"URL":"https:\/\/doi.org\/10.1002\/nem.2321","archive":["Portico"],"relation":{},"ISSN":["1055-7148","1099-1190"],"issn-type":[{"type":"print","value":"1055-7148"},{"type":"electronic","value":"1099-1190"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2024-07-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e2321"}}