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

SRv6‐based Time‐Sensitive Networks (TSN) with low‐overhead rerouting

Author

Listed:
  • Gagan Nandha Kumar
  • Kostas Katsalis
  • Panagiotis Papadimitriou
  • Paul Pop
  • Georg Carle

Abstract

Time‐Sensitive Networks (TSN) aims at providing a solid underpinning for the support of application connectivity demands across a wide spectrum of use cases and operational environments, such as industrial automation and automotive networks. However, handling network updates in TSN entails additional challenges, stemming from the need to perform both flow rerouting and TSN schedule reconfiguration. To address this issue, we propose a software‐defined network (SDN)‐based approach for low‐overhead TSN network updates, exploiting segment routing over IPv6 (SRv6) for path control. To this end, we introduce the concept of TSN subgraphs in order to quickly reschedule the flows traversing the problematic area and propose a TSN‐aware routing heuristic to minimize the convergence time. We further describe the control plane implementation and its integration into Mininet, which empowers us to conduct a wide range of performance tests. Our evaluation results indicate that our approach yields faster recovery and reduces significantly the number of required reconfigurations upon failures, at the expense of a small SRv6 encoding/decoding overhead.

Suggested Citation

  • Gagan Nandha Kumar & Kostas Katsalis & Panagiotis Papadimitriou & Paul Pop & Georg Carle, 2023. "SRv6‐based Time‐Sensitive Networks (TSN) with low‐overhead rerouting," International Journal of Network Management, John Wiley & Sons, vol. 33(4), July.
  • Handle: RePEc:wly:intnem:v:33:y:2023:i:4:n:e2215
    DOI: 10.1002/nem.2215
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/nem.2215?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:33:y:2023:i:4:n:e2215. 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.