Operation expansion policy framework for access points
US-2024357427-A1 · Oct 24, 2024 · US
US2025024327A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2025024327-A1 |
| Application number | US-202418755563-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jun 26, 2024 |
| Priority date | Jul 10, 2023 |
| Publication date | Jan 16, 2025 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method performed by an apparatus capable of multi-link operations with respect to a plurality of channels, comprising determining a fast channel and a slower channel, transmitting a packet in a packet queue using the fast channel without using the slower channel when a number of data packets waiting in the packet queue is smaller than a first threshold number, and transmitting a packet in the packet queue using both the fast channel and the slower channel when the number of data packets waiting in the packet queue is equal to or greater than the first threshold number.
Opening claim text (preview).
What is claimed is: 1 . A method performed by an apparatus capable of multi-link operations with respect to a plurality of channels, comprising: determining a fast channel and a slower channel; transmitting a packet in a packet queue using the fast channel without using the slower channel when a number of data packets waiting in the packet queue is smaller than a first threshold number; and transmitting a packet in the packet queue using both the fast channel and the slower channel when the number of data packets waiting in the packet queue is equal to or greater than the first threshold number. 2 . The method of claim 1 , wherein the first threshold number is determined based on a latency in a scheme that uses the fast channel and the slower channel and a power consumption in the scheme that uses the fast channel and the slower channel. 3 . The method of claim 1 , wherein the first threshold number is determined based on a rate at which packets arrive in the packet queue. 4 . The method of claim 3 , wherein the first threshold number is determined further based on services rates of the fast channel and the slower channel. 5 . The method of claim 3 , wherein if the rate at which packets arrive in the packet queue increases, the threshold is increased. 6 . The method of claim 1 , further comprising turning off the slower channel when a queue associated with the slower channel is empty and a queue associated with the fast channel drops below a second threshold number, the second threshold number being the same as or different than the first threshold number. 7 . The method of claim 1 , further comprising turning off the slower channel when a predetermined time passes. 8 . A station (STA) in a wireless network, the STA comprising: a memory; a processor coupled to the memory, the processor configured to: establish multi-link operation with respect to a plurality of channels including a fast channel and a slower channel; transmit a packet in a packet queue using the fast channel without using the slower channel when a number of data packets waiting in the packet queue is smaller than a first threshold number; and transmit a packet in the packet queue using both the fast channel and the slower channel when the number of data packets waiting in the packet queue is equal to or greater than the first threshold number. 9 . The STA of claim 8 , wherein the first threshold number is determined based on a latency in a scheme that uses the fast channel and the slower channel and a power consumption in the scheme that uses the fast channel and the slower channel. 10 . The STA of claim 8 , wherein the first threshold number is determined based on a rate at which packets arrive in the packet queue. 11 . The STA of claim 10 , wherein the first threshold number is determined further based on services rates of the fast channel and the slower channel. 12 . The STA of claim 11 , wherein if the rate at which packets arrive in the packet queue increases, the threshold is increased. 13 . The STA of claim 8 , wherein the processor is further configured to turn off the slower channel when a queue associated with the slower channel is empty and a queue associated with the fast channel drops below a second threshold number, the second threshold number being the same as or different than the first threshold number. 14 . The STA of claim 8 , wherein the processor is further configured to turn off the slower channel when a predetermined time passes. 15 . A method performed by an apparatus capable of multi-link operations with respect to a plurality of channels, comprising: determining a fast channel and a slower channel; when the fast channel and slower channel are idle, selecting one of the fast channels and the slower channel for transmissions based on a probability; when the slower channel is idle and the fast channel is busy, selecting the slower channel for transmissions; and transmitting a data packet using the selected channel. 16 . The method of claim 15 , further comprising when one of the fast channels and the slower channel finishes a transmission, selecting the finished channel, for a data packet waiting at the head of a packet queue. 17 . The method of claim 15 , wherein an arriving packet waits in a packet queue when both the fast channel and the slower channel are busy. 18 . The method of claim 15 , wherein the probability is determined based on a latency in a first scheme that uses the fast channel and the slower channel and a power consumption in the first scheme that uses the fast channel and the slower channel. 19 . The method of claim 18 , wherein the probability is determined further based on a latency in a second scheme that does not use the slower channel and uses the fast channel and a power consumption in the second scheme. 20 . The method of claim 18 , wherein the latency in the first scheme is determined based on a collision probability, a minimum contention window, a CCA busy time, and a transmit opportunity (TXOP) duration in the first scheme.
using policies · CPC title
for reducing delays · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.