Data Packet Transmission with Dynamic Load Sharing and Flow Order
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current load-balancing technologies in network traffic, such as ECMP and UCMP, utilize static weight parameters, which cannot be dynamically adjusted, leading to potential out-of-order traffic and unsuitability for services with high real-time requirements.
Innovation Solution
Implementing a method and device for data packet transmission that supports dynamic load-sharing by using Segment Routing Policy (SR-Policy) to adjust weights based on network and computing power resources, allowing for dynamic weight adjustments and improved resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If static weight parameters are used in load-balancing technology, then the implementation is simple and stable, but the traffic distribution cannot be dynamically adjusted, leading to poor resource utilization
Solution Approach 1:
The patent transforms the static load-sharing mechanism into a dynamic one by introducing real-time weight parameter adjustments based on actual traffic conditions. The system continuously monitors traffic load and dynamically modifies weight parameters for different paths, enabling adaptive traffic distribution that responds to changing network conditions while maintaining implementation feasibility through structured weight parameter management.
Solution Approach 2:
The patent changes the weight parameters from fixed static values to dynamic values that can be adjusted in real-time based on traffic conditions. By modifying the weight parameters dynamically, the system optimizes traffic distribution across multiple paths according to current network state, resolving the contradiction between simplicity and adaptability.
2Productivity
If dynamic weight parameters are used for load-sharing, then resource utilization is improved, but traffic may become out of order, causing reordering requirements at the destination
Solution Approach 1:
The patent segments traffic into different flows and assigns specific weight parameters to each flow independently. By dividing traffic into manageable segments and applying targeted weight adjustments to each segment rather than globally changing weights, the system maintains traffic order within each flow while still achieving dynamic resource utilization optimization across the network.
Solution Approach 2:
The patent applies different weight parameters to different traffic flows locally rather than using a uniform global weight scheme. This localized approach allows dynamic adjustment of resource allocation for specific flows without disrupting the order of other flows, thereby maintaining traffic reliability while improving overall resource utilization.
3Productivity
If traffic is divided into multiple parts according to static weights, then load distribution is achieved, but the destination requires reordering when weights change, which is not suitable for services with high real-time requirements
Solution Approach 1:
The patent performs preliminary actions by pre-establishing flow identifiers and assigning weight parameters to each flow before traffic transmission begins. By preparing the weight parameter configuration in advance for each flow, the system enables rapid weight adjustments without requiring reordering operations at the destination, thus eliminating reordering time delays while maintaining efficient load distribution.
Data Source
AI summary
A method and a device for transmitting a data packet are provided. The method includes: receiving a first data packet from a second node, wherein the first data packet includes first information indicating a dynamic load-sharing request; selecting, according to the first information, a first path for forwarding the first data packet, and recording an identifier of the first path; receiving a second data packet from the second node, wherein the second data packet includes an identifier of the first path, and the second data packet is a data packet, after the first data packet, of a same traffic; selecting, according to the identifier of the first path, the first path to forward the second data packet.