Bonded Link Packet Queue Management for Latency Variance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network communication systems face challenges in delivering packets from bonded communication links in sequence and reducing time variance, leading to out-of-sequence and bursty packet delivery due to varying latency and bandwidth across different links, resulting in inefficient storage allocation and potential packet loss.
Innovation Solution
The method involves calculating latency differences among bonded communication links, using sequence numbers to determine packet delivery timing, and employing a queue management system that stores or delivers packets based on latency differences and expected sequence numbers, with packets from the link with the largest latency being prioritized for immediate delivery and others stored for later delivery, while updating time tags to adjust for changing network conditions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If packets are stored in a queue to reduce out-of-sequence delivery, then packet sequence reliability is improved, but storage resource waste increases and time variance is reduced
Solution Approach 1:
The patent dynamically adjusts queue storage parameters based on measured latency differences among bonded communication links. By calculating expected arrival times using latency metrics and comparing actual arrivals against these expectations, the system optimizes storage duration and capacity utilization, reducing wasted storage resources while maintaining reliable in-sequence packet delivery.
2Reliability
If storage size is increased to prevent packet loss, then packet reliability is improved, but resource efficiency deteriorates
Solution Approach 1:
The system implements dynamic storage management where queue size and retention policies are continuously adjusted based on real-time network conditions. By monitoring latency differences and packet arrival patterns across bonded links, the system adapts storage allocation to actual needs, preventing both packet loss and resource wastage through responsive, condition-based storage decisions.
3Reliability
If packets from high-latency links are delayed to match sequence, then delivery sequence reliability is improved, but time variance increases
Solution Approach 1:
The patent calculates expected packet arrival times in advance by measuring latency differences among bonded communication links. By determining which packets are likely to arrive out of sequence and preparing appropriate storage or forwarding actions beforehand, the system minimizes actual delivery time variance while ensuring correct sequence ordering, as decisions are made proactively rather than reactively.
Data Source
AI summary
Method and system for storing packets received from a bonded communication links according to latency of the communication link that has the largest latency among all communication links of the bonded communication links. Embodiments of present inventions can be applied to bonded communication links, including wireless connection, Ethernet connection, Internet Protocol connection, asynchronous transfer mode, virtual private network, WiFi, high-speed downlink packet access, GPRS, LTE, and X.25. The present invention presents methods comprising the steps of estimating storage size of a queue, wherein the queue is for storage the one or more packets received from the bonded communication links. The storage size is based on one or more factors, including largest latency, bandwidth of each of the plurality of communication links, and allowed time duration of packet storage.