Abstract

Many organizations nowadays have multiple sites at different geographic locations. Typically, transmitting massive data among these sites relies on the interconnection service offered by ISPs. Segment Routing over IPv6 (SRv6) is a new simple and flexible source routing solution which could be leveraged to enhance interconnection services. Compared to traditional technologies, e.g., physical leased lines and MPLS-VPN, SRv6 can easily enable quick-launched interconnection services and significantly benefit from traffic engineering with SRv6-TE. To parse the SRv6 packet headers, however, hardware support and upgrade are needed for the conventional routers of ISP. In this paper, we study the problem of SRv6 incremental deployment to provide a more balanced interconnection service from a traffic engineering view. We formally formulate the problem as an SRID problem with integer programming. After transforming the SRID problem into a graph model, we propose two greedy methods considering short-term and long-term impacts with reinforcement learning, namely GSI and GLI. The experiment results using a public dataset demonstrate that both GSI and GLI can significantly reduce the maximum link utilization, where GLI achieves a saving of 59.1% against the default method.

Highlights

  • N OWADAYS, it is common that big organizations or companies have many subsidiaries, and each subsidiary has its own private local area network (LAN)

  • We prove that the SRv6 Incremental Deployment problem (SRID) problem is NP-hard

  • We investigate the performance of our methods under different parameter settings. We demonstrate that both Greedy With Short-Term Impact (GSI) and Greedy algorithm with considering Long-term Impacts (GLI) methods can significantly reduce the link utilization, with the GLI method cutting down the maximum link utilization by 59.1% against the default shortest path routing method

Read more

Summary

Introduction

N OWADAYS, it is common that big organizations or companies have many subsidiaries, and each subsidiary has its own private local area network (LAN). Since the value of the segment left field equals 1, the segment list [1] will be activated and be copied into the destination address field, and the packet will be forwarded to Router 2 along the best-effort path between Router 1 and Router 2. If the routers do not support SRv6, they will forward the packet according to the destination address. When Router 2 receives the packet, it will decrease the value of the segment left field to zero and activate segment list [0] and forward it toward 2001::3. When the packet reaches Router 3, it will be decapsulated since the value of the segment left field is zero and forwarded to Site-C

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call