IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v16y2024i4p140-d1380010.html
   My bibliography  Save this article

SUDC: Synchronous Update with the Division and Combination of SRv6 Policy

Author

Listed:
  • Yuze Liu

    (School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China)

  • Weihong Wu

    (School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
    Purple Mountain Laboratory, Nanjing 211111, China)

  • Ying Wang

    (School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China)

  • Jiang Liu

    (School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
    Purple Mountain Laboratory, Nanjing 211111, China)

  • Fan Yang

    (School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
    Purple Mountain Laboratory, Nanjing 211111, China)

Abstract

With the expansion of network scale, new network services are emerging. Segment Routing over IPv6 (SRv6) can meet the diverse needs of more new services due to its excellent scalability and programmability. In the intelligent 6-Generation (6G) scenario, frequent SRv6 Traffic Engineering (TE) policy updates will result in the serious problem of unsynchronized updates across routers. Existing solutions suffer from issues such as long update cycles or large data overhead. To optimize the policy-update process, this paper proposes a scheme called Synchronous Update with the Division and Combination of SRv6 Policy (SUDC). Based on the characteristics of the SRv6 TE policy, SUDC divides the policies and introduces Bit Index Explicit Replication IPv6 Encapsulation (BIERv6) to multicast the policy blocks derived from policy dividing. The contribution of this paper is to propose the policy-dividing and combination mechanism and the policy-dividing algorithm. The simulation results demonstrate that compared with the existing schemes, the update overhead and update cycle of SUDC are reduced by 46.71% and 46.6%, respectively. The problem of unsynchronized updates across routers has been further improved.

Suggested Citation

  • Yuze Liu & Weihong Wu & Ying Wang & Jiang Liu & Fan Yang, 2024. "SUDC: Synchronous Update with the Division and Combination of SRv6 Policy," Future Internet, MDPI, vol. 16(4), pages 1-17, April.
    • Handle: RePEc:gam:jftint:v:16:y:2024:i:4:p:140-:d:1380010
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/16/4/140/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/16/4/140/
    Download Restriction: no
    ---><---

    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:gam:jftint:v:16:y:2024:i:4:p:140-:d:1380010. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.