RSVP-TE MP2MP Labeling Reduces Path State Complexity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current RSVP-TE solutions for MP2MP LSPs in MPLS networks face scalability issues due to high path state complexity, resulting in O(n^2) complexity with the number of nodes, which hinders efficient traffic engineering and bandwidth guarantee in multicast VPNs.
Innovation Solution
The proposed solution involves embedding upstream and downstream labels in PATH and RESV messages, allowing each node to store only one upstream and one downstream label, reducing the maximum state complexity to O(n) by using a forwarding table that associates each adjacent node with a unique label pair.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If RSVP-TE is used to set up MP2MP LSPs with traditional labeling approaches, then traffic engineering and bandwidth guarantee capabilities are achieved, but path state complexity increases to O(n^2) with the number of nodes, reducing scalability
Solution Approach 1:
The patent segments the labeling function by introducing separate upstream and downstream labels for each adjacent node. Instead of using a single complex label structure, the forwarding state is divided into independent upstream and downstream label bindings, where each node maintains separate label information for incoming and outgoing traffic directions. This segmentation reduces the overall state complexity from O(n^2) to O(n) by eliminating redundant label mappings.
Solution Approach 2:
The patent extracts the label binding information from the complex RSVP-TE path state and stores it separately in a dedicated forwarding table structure. By taking out the label-upstream-node associations from the main path state and maintaining them as independent forwarding entries, the system reduces path state complexity while preserving the necessary information for traffic engineering and bandwidth guarantee.
2Manufacturing precision
If RSVP-TE maintains detailed path state for each node pair, then traffic engineering precision is improved, but scalability is reduced due to quadratic state growth
Solution Approach 1:
The patent applies local quality by maintaining precise traffic engineering information locally at each node through the forwarding table, which stores upstream and downstream label bindings specific to each adjacent node. Instead of globally maintaining all possible node-pair states, each node holds only the locally relevant label information needed for its immediate forwarding decisions, achieving O(n) state complexity while preserving traffic engineering precision.
3Adaptability or versatility
If traditional MPLS labeling is used for MP2MP LSPs, then multicast functionality is achieved, but the number of labels required increases quadratically with network size
Solution Approach 1:
The patent makes the label structure universal by introducing a bidirectional labeling mechanism where the same upstream label can be used by multiple downstream nodes, and the same downstream label can be used by multiple upstream nodes. This multi-functional label approach allows a single label to serve multiple nodes in different directions, reducing the total number of labels required from O(n^2) to O(n) while maintaining full multicast functionality.
Data Source
AI summary
An apparatus comprising a processor configured to store a first upstream label in a forwarding table upon receipt of a first message encapsulating the first upstream label from a first adjacent node, store a first downstream label in the forwarding table upon receipt of a second message encapsulating the first downstream label from a second adjacent node, send a third message encapsulating a second downstream label to the first adjacent node, send a fourth message encapsulating a second upstream label to the second adjacent node; and forward data received from a plurality of adjacent nodes over a MP2MP LSP using at least a portion of the labels stored in the forwarding table, wherein each adjacent node is associated with only one upstream label and only one downstream label, and wherein the maximum state complexity of the forwarding table is linear relative to the number of adjacent nodes.