IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v35y2025i1ne2321.html
   My bibliography  Save this article

Multitopology Routing With Virtual Topologies and Segment Routing

Author

Listed:
  • Nicolas Huin
  • Sébastien Martin
  • Jérémie Leguay

Abstract

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‐out, we also show that vMTR allows to drastically reduce SR overhead.

Suggested Citation

  • Nicolas Huin & Sébastien Martin & Jérémie Leguay, 2025. "Multitopology Routing With Virtual Topologies and Segment Routing," International Journal of Network Management, John Wiley & Sons, vol. 35(1), January.
  • Handle: RePEc:wly:intnem:v:35:y:2025:i:1:n:e2321
    DOI: 10.1002/nem.2321
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2321
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.2321?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:intnem:v:35:y:2025:i:1:n:e2321. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.