Dynamic Entropy Generation for Overlay Network Load Balancing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing overlay protocols do not fully exploit the link redundancy in underlay networks, leading to traffic imbalances due to the use of static hashes for entropy values, which can result in packets from the same source and destination being routed through the same underlay links.
Innovation Solution
A dynamic hashing mechanism is employed to generate varying entropy values for packets within different bursts of a traffic flow, adjusting these values based on idle time periods and successful packet delivery thresholds, allowing underlay devices to efficiently distribute traffic across multiple paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If static hash values are used for entropy in overlay packets, then packet routing is simplified, but traffic imbalance occurs across underlay network links
Solution Approach 1:
The patent applies dynamics by transitioning from static hash values to dynamic entropy values that change based on packet sequence numbers and idle time detection. This allows the routing behavior to adapt over time, enabling traffic from the same flow to be distributed across multiple underlay links while maintaining routing simplicity through automated dynamic adjustment.
Solution Approach 2:
The patent changes the parameter of entropy values from static to dynamic by incorporating packet sequence numbers and detecting idle time periods. This parameter transformation enables the same source-destination pair to generate different entropy values for different packet groups, thereby achieving load balancing across multiple underlay links without increasing routing complexity.
2Productivity
If dynamic entropy values are generated for all packets, then traffic distribution across underlay links is improved, but processing overhead increases
Solution Approach 1:
The patent segments traffic flows into different groups based on idle time detection between packet arrivals. By dividing continuous traffic into discrete groups that can be routed independently, the system achieves better load balancing while reducing processing overhead, as each group can be handled with a single entropy value generation rather than per-packet processing.
Solution Approach 2:
The patent implements periodic action by generating entropy values at specific intervals based on idle time thresholds. Instead of dynamically adjusting every packet, the system periodically regenerates entropy values when idle time exceeds a threshold, reducing processing overhead while still achieving effective traffic distribution across underlay links.
3Stability of the object's composition
If packets from the same flow use the same entropy value, then routing consistency is maintained, but link redundancy is not fully exploited
Solution Approach 1:
The patent applies dynamics by making entropy values change over time for the same traffic flow based on detected idle periods. This allows the system to maintain routing consistency within packet groups while adapting to exploit link redundancy by directing different groups through different underlay paths, achieving both stability and versatility.
Solution Approach 2:
The patent applies preliminary action by detecting idle time periods in advance and proactively generating new entropy values for subsequent packet groups. This preliminary detection and adjustment ensures that routing consistency is maintained within groups while preparing for link redundancy exploitation at the appropriate moments, balancing both requirements.
Data Source
AI summary
Embodiments disclose systems, methods, and computer program products to perform an operation for generating entropy values for packets in an overlay network. The operation generally includes generating a first entropy value for each packet in a first group of packets received in a sequence of packets from a host, and detecting an idle amount of time between the the first group of packets in the sequence of packets and a second group of packets in the sequence of packets received from the host. The operation also includes upon determining that the idle amount of time is greater than a first threshold, generating a second entropy value for each packet in the second group of packets. The operation further includes inserting the second entropy value in an outer header of each packet in the second group of packets, and transmitting the second group of packets to the underlay network.