Random Access Prioritization via Queue Preemption
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless local area networks (WLANs), the random access procedure often results in unpredictable prioritization of packets, leading to potential delays and reduced service times for priority packets due to the randomness of the access process, which can cause lower priority queues to be served before higher priority ones.
Innovation Solution
A method and apparatus that interrupt and prioritize the random access procedure for packets assigned to higher priority queues, utilizing previously sensed idle time slots from lower priority queues to accelerate the back-off process for priority packets, ensuring they are served promptly by considering these slots as idle for the priority queue's back-off counter.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If the random access procedure is used for packet transmission in WLAN, then the access process is simple and decentralized, but the prioritization of packets becomes unpredictable and lower priority queues may be served before higher priority ones
Solution Approach 1:
The patent applies preliminary action by having the high priority queue preempt the random access procedure of the low priority queue before the low priority queue completes its back-off process. The high priority queue interrupts the low priority queue's random access procedure and performs its own access procedure, ensuring that high priority packets are transmitted before low priority packets can be served. This resolves the contradiction by maintaining the simplicity of random access while ensuring reliable prioritization through preemptive intervention.
2Productivity
If the back-off counter is used for random access, then the access time is extended for fairness, but the transmission time for priority packets is increased due to continued back-off process
Solution Approach 1:
The patent applies the extraction principle by extracting the back-off process from the low priority queue when a high priority packet arrives. The high priority queue preemptively interrupts the low priority queue's back-off process and performs its own access procedure. This extraction ensures that the high priority packet can be transmitted without waiting for the low priority queue to complete its back-off, thereby reducing transmission time delay while maintaining access time efficiency through the preemption mechanism.
3Adaptability or versatility
If all queues compete simultaneously in random access, then the access process is fair and simple, but high priority packets may not be served first due to randomness
Solution Approach 1:
The patent applies preliminary action by having the high priority queue perform a preliminary check and preempt the random access procedure of the low priority queue before the low priority queue completes its back-off process. The high priority queue interrupts the low priority queue's access procedure and performs its own access procedure, ensuring that high priority packets are transmitted before low priority packets. This resolves the contradiction by maintaining the fairness and simplicity of random access while ensuring reliable priority service through preemptive intervention.
4Device complexity
If the random access procedure continues for low priority queues, then the access process remains simple, but the overall transmission time is increased due to continued back-off and competition
Solution Approach 1:
The patent applies the extraction principle by extracting the back-off process from the low priority queue when a high priority packet arrives. The high priority queue preemptively interrupts the low priority queue's back-off process and performs its own access procedure. This extraction ensures that the high priority packet can be transmitted without waiting for the low priority queue to complete its back-off, thereby reducing total transmission time while maintaining access control simplicity through the preemption mechanism.
Data Source
AI summary
A prioritization method for random access, comprising receiving one or more first packet flow for transmission, wherein the one or more first packet flow is assigned a respective access category queue, initiating a random access procedure for the first packet flow, receiving a packet of a second packet flow for transmission, wherein the second packet flow is assigned an access category queue having priority over the access category queue assigned to the first packet flow, issuing an indication configured to interrupt the random access procedure for the first packet flow, and performing a random access procedure for the received packet of the second packet flow wherein idle time slots previously sensed by the random access procedure for the first packet flow are considered as sensed also for the random access procedure for the second packet flow. Corresponding apparatus and computer program product are also disclosed.