Trunk Selection Algorithm for Network Protection and Load Balancing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing link/node protection methods in connection-oriented networks do not effectively optimize the building of alternate paths to balance uneven data traffic loads as networks grow and carry more data, leading to potential failures and inefficiencies in rerouting data traffic.
Innovation Solution
Implementing a link/node protection scheme that uses Next Hop or Next Next Hop protection, where bypass tunnels are established based on setup and holding priorities, with a trunk selection algorithm to allocate bandwidth efficiently and preempt lower-priority paths when necessary, ensuring fast rerouting of data traffic in case of failures.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing link/node protection methods are used, then network protection is provided, but data traffic loads remain unbalanced among different trunks and nodes
Solution Approach 1:
The system pre-calculates and pre-establishes multiple alternate paths (next-hop and next-next-hop protection) before failures occur. This preliminary action allows the network to have ready-to-use backup routes that can be activated immediately, while also enabling load balancing by distributing traffic across multiple pre-computed paths during normal operation
Solution Approach 2:
The patent implements dynamic path selection and load distribution mechanisms that adapt to current network conditions. The system can dynamically adjust which alternate paths are used and how traffic is distributed among them, optimizing both protection and load balancing based on real-time network state
2Productivity
If network capacity is increased to carry more data traffic, then network throughput is improved, but traffic load imbalance among trunks and nodes worsens
Solution Approach 1:
The patent segments the network into multiple hierarchical levels of alternate paths (next-hop and next-next-hop). This segmentation allows traffic to be distributed across different segments and levels, preventing concentration on single trunks or nodes while maintaining overall network throughput capacity
3Speed
If fast rerouting is implemented with limited response time, then failure recovery speed is improved, but path selection optimization is reduced
Solution Approach 1:
The system performs preliminary path calculation and preparation before failures occur, maintaining multiple pre-computed alternate paths with associated metrics. This preliminary work enables fast rerouting by eliminating the need for complex real-time optimization during failure recovery, while still achieving optimal path selection through pre-analyzed alternatives
Data Source
AI summary
A system and method for protecting a trunk with multiple trunks may select a primary path on a first trunk for which to place a corresponding bypass tunnel on a second trunk. The system and method may further select one or more alternate trunks using a constraint-based trunk-selection algorithm. The system and method may further determine if at least one of the selected alternate trunks has sufficient priority bandwidth. In the event that one or more alternate trunks have priority bandwidths larger than the physical bandwidth of the primary path, the system and method may select an alternate trunk from the one or more alternate trunks having priority bandwidths larger than the physical bandwidth of the primary path based on a pre-determined order of priority bandwidth.