BIER Header Sequential Delivery Reduces IPv6 Service Chaining Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing service chaining methods, particularly with IPv6, face inefficiencies when dealing with long lists of destinations, as using 128 bits per visited node becomes impractical, leading to high header overhead and inefficient packet delivery.
Innovation Solution
The implementation of Bit Indexed Explicit Replication (BIER) headers allows for sequential packet delivery by modifying the BIER algorithm to set bits to zero as packets reach their destinations, reducing overhead and enabling flexible sequential delivery while maintaining compatibility with BIER routing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If IPv6 segment routing is used to encode destinations as a list of IPv6 destinations, then service chaining capability is provided, but header overhead becomes excessive and packet delivery becomes inefficient when the list of destinations grows
Solution Approach 1:
The patent segments the destination list into multiple segments, where each segment contains a limited number of destinations (e.g., up to 8). Instead of encoding all destinations in a single IPv6 address list, the patent divides them into separate segments that can be processed independently. This segmentation reduces the header overhead for each segment while maintaining the ability to chain multiple services through multiple segments.
Solution Approach 2:
The patent introduces a new dimensional approach by using segment indices and segment identifiers alongside the traditional destination encoding. Instead of a flat list of destinations, the patent adds a hierarchical dimension with segments organized in groups, allowing efficient routing through multiple destinations without linearly increasing header size with each additional destination.
2Adaptability or versatility
If the list of destinations grows in service chaining, then more services can be chained, but the practicality of using 128 bits per visited node becomes unsustainable
Solution Approach 1:
The patent merges multiple destination encodings into a unified segment structure. Instead of treating each destination as a separate 128-bit IPv6 address that accumulates in the header, the patent combines multiple destinations into compact segment representations that share common routing information, thereby reducing the total header size required to represent a long chain of services.
Solution Approach 2:
The patent changes the parameter representation from full 128-bit IPv6 addresses for each destination to compressed segment identifiers and indices. By transforming the representation parameters (from complete addresses to relative indices within segments), the patent dramatically reduces the quantity of data required in the header while preserving the ability to identify and route to numerous destinations.
3Productivity
If parallel replication is used to deliver packets to multiple destinations, then all destinations receive the packet simultaneously, but this approach is inefficient for sequential service chaining requirements
Solution Approach 1:
The patent introduces dynamic control over packet delivery sequencing through the segment structure. Instead of static parallel replication, the segment-based approach allows dynamic determination of delivery order based on segment indices and routing state. This enables the system to adaptively control whether packets are delivered sequentially or in parallel depending on the specific service chaining requirements, providing operational flexibility.
Solution Approach 2:
The patent implements feedback mechanisms through segment index tracking and destination matching. As packets traverse the network, intermediate nodes use feedback from previous routing decisions to determine the next segment to process, enabling controlled sequential delivery when required. The feedback loop ensures that packets are delivered to destinations in the correct sequence for service chaining while maintaining efficiency.
Data Source
AI summary
Disclosed is a method that modifies a bit indexed explicit replication (BIER) algorithm. The method includes receiving a packet at a node, wherein the packet includes a BIER header identifying a bitstring, the bitstring including a first bit indicating a first destination and a second bit indicating a second destination and forwarding the packet through one or more networks toward the first destination and the second destination based on the bitstring and a predetermined bit selection order. The predetermined bit selection order causes a sequential delivery of the packet to the first destination and the second destination. After the packet arrives at the first destination, the method includes setting the first bit to zero in the bitstring and forwarding the packet through the one or more networks toward the second destination according to the updated bitstring.