Packet Reorder Structure for Network Transmission Fairness
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network technologies face challenges in ensuring fairness in data transmission and reception due to difficulties in precisely modifying cable lengths and inaccuracies in distributing network loads, especially in large-scale networks.
Innovation Solution
The technology reorders packets received by a network using timestamps appended to the packets, corresponding to when the sender loses control and the receiving network gains control. This allows for dynamic adjustment of timeslot durations based on the number of out-of-order packets to maintain fairness.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If cable lengths are modified to ensure fairness in data transmission, then transmission fairness is improved, but implementation difficulty and cost increase
Solution Approach 1:
The patent replaces the mechanical approach of physically modifying cable lengths with a software-based packet reordering mechanism. Instead of changing physical network infrastructure, the system uses timestamp-based tracking and reordering buffers to achieve fairness, eliminating the need for precise cable length modifications while maintaining transmission fairness.
Solution Approach 2:
The patent introduces timestamp metadata and reordering buffers as intermediary elements between packet transmission and processing. These intermediaries track packet arrival times and reorder packets to compensate for varying path delays, achieving fairness without direct modification of physical cable lengths.
2Reliability
If network loads are distributed amongst network switches to ensure fairness, then fairness is partially improved, but accuracy and feasibility in large-scale networks deteriorate
Solution Approach 1:
The patent implements a feedback mechanism where each packet carries a timestamp indicating when the sender lost control of the packet. The receiving network uses these timestamps to monitor packet arrival patterns and dynamically adjust reordering behavior, providing precise measurement and correction of fairness issues at individual packet level rather than relying on coarse load distribution.
Solution Approach 2:
The patent changes the approach from distributing network loads (macro-level parameter) to adjusting packet timing parameters (micro-level parameters). By modifying how packets are timed and reordered based on individual timestamps, the system achieves higher precision in fairness measurement and correction without the limitations of load distribution methods.
3Reliability
If packets are reordered based on timestamps to reduce unfairness, then transmission fairness is improved, but processing complexity increases
Solution Approach 1:
The patent segments the packet reordering process into distinct functional components: timestamp appending at the sender, timestamp-based classification at the receiver, and buffered reordering. This segmentation allows each component to perform a specific function efficiently, reducing overall processing complexity compared to holistic reordering approaches.
Solution Approach 2:
The patent performs preliminary actions by appending timestamps to packets at the sender before transmission. This preliminary tagging enables the receiving network to process packets more efficiently, as the timing information is already available and does not require complex extraction or calculation during reception and reordering operations.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The technology is generally directed to reordering packets received by a network to reduce the unfairness in transmitting and receiving data. The packets may be reordered based on a timestamp appended to the packet. The timestamp may correspond to a time when the sender loses control of the packet and the receiving network gains control. A packet reorder structure may receive the packets with the appended timestamps during a sample interval. The packet reorder structure may compare the timestamp to a time interval for a plurality of timeslots. The packets may be reordered based on the timeslot the packet is allocated to. In some examples, the duration of the timeslot may be dynamically adjusted such that the number of out of order packets received during the sample interval corresponds to a threshold.