Data Packet Distributor for Low-Latency Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data packet transmission systems experience delays due to head-of-line-blocking (HOLB) issues, particularly in real-time applications like multimedia streaming, where data packets are transmitted in a first-in-first-out (FIFO) manner, causing bottlenecks even when other destination queues are available.
Innovation Solution
A data packet distributor (DPD) system that identifies destination queues based on availability and uses counters to manage data packet transmission, storing packets when queues are full and re-attempting transmission when queues become available, ensuring data packets are transmitted in an orderly manner without causing HOLB.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If data packets are transmitted in FIFO manner, then transmission order is maintained, but transmission delay increases due to head-of-line-blocking
Solution Approach 1:
The patent segments the transmission process by introducing separate buffering zones for different data packet types (voice packets in first buffer, data packets in second buffer). This allows independent management and transmission of different packet types, enabling voice packets to be transmitted immediately when available without waiting for data packets, thus reducing head-of-line-blocking delay while maintaining overall transmission order through targeted reordering at the receiving end.
2Stability of the object's composition
If data packets are stored in destination queue before transmission, then transmission order is preserved, but other available queues cannot receive packets due to blocking
Solution Approach 1:
The patent divides the destination queue into multiple independent buffers (first buffer for voice packets, second buffer for data packets). This segmentation allows packets for different queue types to be processed independently. When voice packets are ready, they can be transmitted immediately from the first buffer without being blocked by data packets in the second buffer, thereby improving overall queue utilization efficiency while preserving transmission order within each buffer type.
Solution Approach 2:
The patent introduces a reordering buffer as an intermediary component between the segmented buffers and the final transmission interface. This reordering buffer receives packets from different buffers, temporarily stores them, and then transmits them in the correct overall sequence. This intermediary mechanism resolves the conflict between independent buffer processing and global transmission ordering, allowing high queue utilization while maintaining packet order.
3Reliability
If waiting for destination queue availability, then packet loss is avoided, but transmission latency increases for real-time applications
Solution Approach 1:
The patent performs preliminary actions by pre-buffering voice packets in the first buffer before they are needed for transmission. This allows the system to immediately transmit voice packets when the destination queue becomes available, without waiting for data packets to be processed first. The preliminary buffering of time-sensitive packets reduces transmission latency for real-time applications while maintaining reliability through the structured buffer management and reordering mechanism.
Data Source
AI summary
A data packet distributor (DPD) includes a memory and a data packet transmission device (DPTD) connected to the memory. The DPTD receives a first data packet and identifies a destination queue for attempting transmission of the first data packet. The attempt for transmission is unsuccessful when a second data packet associated with the identified destination queue is present in the memory or the identified destination queue is unavailable for receiving the first data packet. The DPTD stores the first data packet in the memory when the attempt is unsuccessful. The DPTD re-attempts the transmission of the first data packet to the identified destination queue at end of a time interval. The re-attempt is successful when the second data packet is absent in the memory and the identified destination queue is available for receiving the first data packet.