Queue Management Reducing Latency in Data Packet Communication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Wi-Fi communication technologies suffer from high latency, which is exacerbated by the need for high-speed infrastructure that is costly and not readily available in developing countries, leading to inefficiencies in bandwidth usage and increased retransmission of data packets.
Innovation Solution
A method that manages data packet queues by allocating packets based on global and local threshold limits, dropping packets from the longest queues when limits are exceeded, and processing packets in a predetermined sequence to minimize latency, using a queueing layer with reference tables to track queue lengths and sizes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple data packet queues are processed on a weighted round robin basis to minimize idle time, then bandwidth usage is optimized, but latency increases due to packet inundation and retransmissions
Solution Approach 1:
The patent segments data packets into different priority categories (high priority and normal priority queues) and processes them in a specific sequence. High priority packets are processed immediately upon arrival, while normal priority packets are processed only when the high priority queue is empty. This segmentation eliminates the need for weighted round robin processing, reducing latency while maintaining bandwidth efficiency.
Solution Approach 2:
The patent establishes a predetermined processing hierarchy before packets arrive, where high priority queues are always processed before normal priority queues. This preliminary action prevents packet inundation by ensuring that critical packets are handled first, reducing retransmissions and latency without requiring complex runtime scheduling decisions.
2Speed
If high-speed technologies are used to compensate for high latency rates, then communication speed improves, but infrastructure costs increase and health hazards arise
Solution Approach 1:
The patent changes the parameter of packet processing priority rather than increasing physical communication speed. By implementing a priority-based queueing system where high priority packets are processed immediately and normal priority packets are processed when high priority queues are empty, the system achieves effective speed improvement for critical communications without requiring expensive high-speed infrastructure upgrades.
3Productivity
If data packets are accumulated in queues to maintain continuous transmission, then bandwidth utilization improves, but latency increases due to packet accumulation
Solution Approach 1:
The patent implements a dynamic queue processing system where the processing order changes based on queue content and priority levels. When high priority packets arrive, the system dynamically switches to processing only high priority queues. When high priority queues are empty, it dynamically transitions to processing normal priority queues. This dynamic adaptation maintains bandwidth utilization while preventing excessive latency accumulation.
Data Source
AI summary
A method of reducing latency in communication of data packets comprising the steps of: receiving a data packet from a first device; determining whether the addition of the data packet results in the current number of data packets stored in all data queues exceeds a global threshold limit, where if the addition of the data packet results in the number of data packets stored not exceeding the global threshold limit then (i) allocate the data packet to a queueing group based on a predetermined factor; (ii) determine whether the addition of the data packets results in the number of data packets stored in the data queues of the allocated queueing group exceeds a local threshold limit. However, if the addition of the data packet results in the number of data packets stored not exceeding the local threshold limit then allocate the data packet to a data queue in the allocated queueing group based on the predetermined factor. The data packets stored in each data queue of a queueing group thereafter being processed as normal. But, if the addition of the data packet results in either the global threshold limit or the local threshold limit being exceeded, the first data packet from the longest data queue in an identified queueing group is dropped, the identified queueing group being a queuing group pointed to by a pointer in the case of the global threshold limit being exceeded and the identified queueing group by the allocated queueing group in the case of the local threshold limit being exceeded.