Load Sharing Vector for Communication Network Targets
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional load sharing methods in communication networks face limitations, particularly with connection-less transport protocols and the ITU-T standard's four-bit SLS parameter, which restricts efficient load sharing among more than 16 ASPs or routes, and inefficiently manage re-routing and capacity weights.
Innovation Solution
A method for generating a load sharing vector that determines available communication targets by using a target distribution vector, normalizing entries based on capacity, and randomly reordering them to create a cache-based load sharing vector, allowing for efficient distribution and re-routing across multiple communication targets.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the SLS parameter is used for load sharing among multiple ASPs or routes, then load distribution is achieved, but the four-bit limitation restricts load sharing to only 16 targets maximum
Solution Approach 1:
The patent transitions from a single four-bit SLS parameter to a multi-dimensional structure consisting of a four-bit SLS parameter combined with a load sharing vector. This vector contains multiple entries, each with an SLS value and an ASP identifier, enabling identification of more than 16 load sharing targets by adding the dimension of vector entries rather than increasing the bit length of a single parameter
Solution Approach 2:
The load sharing information is segmented into multiple vector entries rather than using a single parameter. Each entry in the load sharing vector represents a separate ASP or route, allowing the system to handle more than 16 targets by dividing the overall load sharing information into discrete, manageable entries that can be processed individually
2Adaptability or versatility
If controlled re-routing is implemented when routes become available, then traffic can be redirected, but traffic must be buffered until timer expires increasing delay
Solution Approach 1:
The load sharing vector is dynamically updated to reflect current route availability without requiring buffered traffic. When a route becomes available or fails, the vector is modified in real-time to include or exclude the corresponding ASP identifier, allowing immediate re-routing of traffic without timer-based delays or buffering requirements
Solution Approach 2:
The system preliminarily establishes the load sharing vector with all potential ASPs or routes before actual traffic flow begins. This preconfiguration allows the system to immediately utilize available routes without needing to buffer traffic and wait for timer expiration, as the routing decisions are already prepared in the vector structure
3Productivity
If capacity-weighted load sharing is implemented, then efficient traffic distribution is achieved, but re-routing complexity increases when maintaining capacity weights
Solution Approach 1:
The patent uses copying of ASP identifiers into the load sharing vector entries to maintain capacity-weighted distribution. Each entry in the vector is a copy of the relevant routing information, allowing the system to maintain multiple copies of capacity weight information that can be independently updated without complex interdependencies, thereby simplifying re-routing operations while preserving capacity-weighted efficiency
Data Source
AI summary
The invention relates to a method for generating a load sharing vector indicating a plurality of communication targets for load sharing in a communication network. The method comprises providing a target distribution vector comprising a first number of entries indicating a first communication target, and comprising a second number of entries indicating a second communication target, and generating the load sharing vector upon the basis of active entries of the target distribution vector, the active entries indicating the communication target of the first or the second communication target which is available for load sharing in the communication network.