Method for a simple 802.11e HCF implementation

• US 8,270,381 B2
• Filed: 06/28/2010
• Issued: 09/18/2012
• Est. Priority Date: 03/21/2003
• Status: Expired due to Term

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Meier, Robert
• Primary Examiner(s): Gonzalez, Amancio
• Application Number:
  US12/824,766
• Publication Number:
  US 20100265907A1
• Time in Patent Office: 813 Days
• Field of Search: 370/230.1, 370/329, 370/338, 370/310, 455/450
• US Class Current: 370/338
• CPC Class Codes: H04W 28/14 using intermediate storage
• CPC Class Codes: H04W 74/06 using polling
• CPC Class Codes: H04W 84/12 WLAN [Wireless Local Area Networks]
• CPC Class Codes: H04W 88/08 Access point devices
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A Hybrid Coordination Function (HCF) implementation wherein an access point'"'"'s existing (E)DCF transmit queues are augmented by at least one strict priority HCF transmit queue. The HCF queues are only used to schedule downlink data and CF-Poll transmissions are used for admitted downlink flows and for uplink flows. The 802.1D user priority value is used to select the HCF queue for an admitted flow. The strict priority HCF transmit queues are always serviced first, in priority order before any other (E)DCF transmit queue. The channel is considered busy to (E)DCF transmit queues while the strict priority queues are being serviced. An admissions control mechanism is used to control data flows and prevents the strict priority traffic from starving (E)DCF traffic. A single, simple AP scheduler is used for scheduling both polling times and station wakeup time.

Claims

1. A method for controlling access by an access point, comprising:

allocating a fixed transmission window to a target station, the transmission window of sufficient size to enable the target station to send a queued frame in response to a poll;

establishing a polling schedule for the target station;

allocating a maximum amount of uplink data based on an application data rate for the target station;

polling the target station according to the polling schedule when the uplink data sent by the target station does not exceed an admitted data rate; and

,

reclaiming a channel by the access point when the access point receives a response from the target station indicating a last frame of the uplink data explicitly returning the channel to the access point.

2. The method of claim 1, the polling further comprising transmitting a poll, the poll comprising a duration field, wherein the duration field is set to the fixed transmission window.

3. The method of claim 1, further comprising sending a frame to reduce the channel reservation when the access point does not receive an expected response from the target station.

4. The method of claim 1, further comprising reclaiming the channel by the access point when the access point does not receive an expected response from the target station.

5. The method of claim 1, wherein:

the allocating step further comprises allocating a token bucket for a data stream with a predetermined number of tokens, wherein the sum of the tokens represent a maximum allowed burst for the data stream; and

the polling further comprises;

adding a token to the token bucket each time a service timer for the data stream expires, and

removing tokens from the token bucket each time a data frame is successfully transferred.

6. The method of claim 5, wherein polling is suspended when the token bucket has no tokens.

7. The method of claim 5, wherein downlink frames are not queued in a strict priority queue when the token bucket has no tokens.

8. The method of claim 5, wherein the data stream is an uplink data stream.

9. The method of claim 5, wherein the data stream is a downlink data stream.

10. The method of claim 1, wherein polls for the target station are inserted into a strict priority queue;

and

wherein a hybrid coordination function is employed to prioritize channel access for sending polls in the strict priority queue.

21. The method of claim 1, wherein allocating a fixed transmission window further comprises receiving from the target station data representative of a minimum transmission window size;

wherein the fixed transmission window is at least the size indicated by the data representative of a minimum transmission window size.

11. An access point, comprising

at least one strict priority transmit queue and at least one transmit queue having a lower priority than strict priority queue;

and

wherein the access point is operative to allocate a fixed transmission window to a target station, the transmission window of sufficient size to enable the target station to send a queued frame in response to a poll;

wherein the access point is further operative to establish a polling schedule for the target station;

wherein the access point is further operative to allocate a maximum amount of uplink data based on an application data rate for the target station;

wherein the access point is further operative to poll the target station according to the polling schedule by placing a poll frame in the strict priority queue when the uplink data sent by the target station does not exceed an admitted data rate; and

,

wherein the access point is further operative to reclaim a channel when the access point receives a response from the target station indicating a last frame of the uplink data explicitly returning the channel to the access point.

12. The access point of claim 11, wherein the poll frames comprises a duration field, wherein the duration field is set to the fixed transmission window.

13. The access point of claim 11, further operative to send a frame to reduce the channel reservation when the access point does not receive an expected response from the target station.

14. The access point of claim 11, further operative to reclaim the channel when the access point does not receive an expected response from the target station.

15. The access point of claim 11, further operative to allocate a token bucket for a data stream with a predetermined number of tokens, wherein the sum of the tokens represent a maximum allowed burst for the data stream;

wherein the access point is operative to add a token to the token bucket each time a service timer for the data stream expires, and

wherein the access point is further operative to remove tokens from the token bucket each time a data frame is successfully transferred.

16. The access point of claim 15, operative to suspended polling when the token bucket has no tokens.

17. The access point of claim 15, wherein downlink frames are queued in the at least one transmit queue having a lower priority than strict priority queue when the token bucket has no tokens.

18. The access point of claim 15, wherein the data stream is an uplink data stream.

19. The access point of claim 15, wherein the data stream is a downlink data stream.

20. The access point of claim 11, wherein a hybrid coordination function is employed to prioritize channel access for sending polls in the strict priority queue.