Packet Header Forwarding for Looped Multicast Data Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data forwarding technologies, such as Bit Indexed Explicit Replication (BIER), prevent loop formation and limit scalability in data processing, hindering their effectiveness in future networks with complex data paths and multicast transmissions.
Innovation Solution
A system and method for data forwarding and processing using a control plane function that configures forwarding tables with directed graphs, packet header information, and bitwise operations to manage data paths and functions across processing nodes, enabling looped and multicast transmissions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing data forwarding technologies like BIER are used, then loop formation is prevented, but complex data paths and multicast transmissions are hindered
Solution Approach 1:
The patent segments the data forwarding process into multiple independent forwarding tables (FT0, FT1, FT2, etc.), each handling specific segments of the data path. This allows complex multicast transmissions to be broken down into manageable hops, where each forwarding table processes a portion of the overall data flow independently, enabling both loop prevention and complex path support.
Solution Approach 2:
The patent introduces a control plane function as an intermediary that configures and manages multiple forwarding tables. This intermediary coordinates the data flow through directed graphs, allowing complex multicast transmissions to be orchestrated without direct peer-to-peer interactions that could create loops, while still supporting versatile data paths.
2Reliability
If existing technologies prevent one node from receiving packets from different upstream nodes, then packet duplication is avoided, but scalability in data processing configuration is limited
Solution Approach 1:
The patent adds a temporal dimension to packet handling by introducing Time To Live Values (TTLVs) associated with different forwarding table IDs. Packets are processed through multiple forwarding tables in sequence, with each table representing a different time hop. This allows nodes to receive and process packets from different upstream nodes at different times, preventing duplication while enabling scalable configuration.
Solution Approach 2:
The patent makes the forwarding configuration dynamic by allowing the control plane to programmatically configure multiple forwarding tables with different directed graphs. Each forwarding table can be independently configured and updated, enabling the system to adapt to changing network conditions and scale data processing configurations without rigid constraints.
3Adaptability or versatility
If multiple forwarding tables with directed graphs are used, then complex data paths and multicast transmissions are enabled, but system complexity increases
Solution Approach 1:
The patent creates a universal control plane function that can configure and manage multiple forwarding tables through a standardized interface. This multi-functional control plane handles diverse multicast transmission requirements using the same configuration mechanism, reducing the apparent complexity at individual network nodes while enabling versatile data paths.
Solution Approach 2:
The control plane performs preliminary configuration of all forwarding tables and directed graphs before data transmission begins. By pre-configuring the entire data path through multiple forwarding tables, the system eliminates the need for complex runtime decision-making at individual nodes, reducing operational complexity while supporting multicast transmissions.
4Productivity
If Time To Live Values are associated with forwarding table IDs, then packet routing through multiple paths is controlled, but packet header complexity increases
Solution Approach 1:
The patent nests the Time To Live Value (TTLV) within the packet header alongside the Forwarding Table ID (FTID), creating a compact combined structure. This nested arrangement allows both routing control and hop counting functionality to be carried in a single integrated header field, minimizing the increase in packet header complexity while enabling efficient multi-path forwarding.
Data Source
AI summary
The disclosure provides for systems and methods for data forwarding and data processing. According to an aspect a method is provided. The method may include receiving, from a control plane function, packet header configuration information. including a plurality of forwarding table identifiers (FTIDs) associated with a respective plurality of forwarding tables (FTs). Each FT of the plurality of FTs may define a path to be followed by the processing data when the communication network provides the network service. The plurality of FTs may define a sequence of paths to be followed by the processing data. The method may further include encapsulating into a header of a packet, configured packet header information based on the packet header configuration information. The method may further include sending, to a second PF of the PPFs, the packet in accordance with a first FT of the plurality of FTs.