ScholarLens Back to search
2023•IEEE Networking LettersRequires access

A Hybrid Approach to Header Size and Forwarding Table Optimization in Segment Routing

Anushree Roy, Tania Sarkar, Pranav Kumar Singh, Ranjan Maity

Open publisher page 2 citations

Abstract

Segment Routing is a source routing paradigm that simplifies packet forwarding and management across networks. Two major challenges of segment routing are the limitation of header stack size and the size of the Forwarding Table specific to each node. It has been observed that there is a trade-off between these two factors. In this paper, we have addressed this trade-off and presented a mechanism to minimize the stack size as well as the forwarding table. Instead of individual Segment IDs used in traditional segment routing, unique Path IDs are considered. This reduces the size of the header stack to one irrespective of the number of segments in the path. To reduce the size of the forwarding table, a forwarding technique based on matrix operations is used. Our approach also works on the reliability issues in forwarding and guarantees 100% successful packet forwarding.

About this research paper

What this paper is about

Segment Routing is a source routing paradigm that simplifies packet forwarding and management across networks. Two major challenges of segment routing are the limitation of header stack size and the size of the Forwarding Table specific to each node. It has been observed that there is a trade-off between these two factors. In this paper, we have addressed this trade-off and presented a mechanism to minimize the stack size as well as the forwarding table. Instead of individual Segment IDs used in traditional segment routing, unique Path IDs are considered. This reduces the size of the header stack to one irrespective of the number of segments in the path. To reduce the size of the forwarding table, a forwarding technique based on matrix operations is used. Our approach also works on the reliability issues in forwarding and guarantees 100% successful packet forwarding.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Segment Routing is a source routing paradigm that simplifies packet forwarding and management across networks. Two major challenges of segment routing are the limitation of header stack size and the size of the Forwarding Table specific to each node. It has been observed that there is a trade-off between these two factors. In this paper, we have addressed this trade-off and presented a mechanism to minimize the stack size as well as the forwarding table. Instead of individual Segment IDs used in traditional segment routing, unique Path IDs are considered. This reduces the size of the header stack to one irrespective of the number of segments in the path. To reduce the size of the forwarding table, a forwarding technique based on matrix operations is used. Our approach also works on the reliability issues in forwarding and guarantees 100% successful packet forwarding.

Key concepts: Routing table, Virtual routing and forwarding, Packet forwarding, Header, Computer science, Source routing, Equal-cost multi-path routing, Computer network

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
A Hybrid Approach to Header Size and Forwarding Table Optimization in Segment Routing — Research Paper | ScholarLens