WLAN access scheduling control

• US 7,379,462 B2
• Filed: 04/01/2003
• Issued: 05/27/2008
• Est. Priority Date: 04/01/2003
• Status: Active Grant

• Current Assignee: Texas Instruments, Inc.
• Original Assignee: Texas Instruments, Inc.
• Inventors: Ho, Jin-Meng
• Primary Examiner(s): Orgad; Edan
• Assistant Examiner(s): Chu; Wutchung
• Application Number:
  US10/404,268
• Publication Number:
  US 20040196850A1
• Time in Patent Office: 1,883 Days
• Field of Search: 370/395.4, 370/395.43, 370/395.41, 370/310, 370/338, 370/235, 370/310.1, 370/389, 370/392, 370/390, 370/241
• US Class Current: 370/395.4
• CPC Class Codes: H04W 28/10 Flow control between communication endpoints
• CPC Class Codes: H04W 72/535 based on resource usage policies
• CPC Class Codes: H04W 84/12 WLAN [Wireless Local Area Networks]

Abstract

A system for scheduling access times for transmitting data traffic in a WLAN including both isochronous streams and asynchronous bursts characterized by widely varying parameter values generates a succession of service periods, each having adjustable length and including two or other number of primary access intervals. The service periods may also be adapted to include one or more asynchronous burst periods, each immediately following a primary access interval. Access times for each isochronous stream are scheduled only during a primary access interval, or an immediately following extension period. Asynchronous bursts are scheduled for access times only during asynchronous burst periods. Epoch lengths fluctuate dependent on the dynamic needs and priorities of user traffic. Thus, an access time scheduling is made available that can readily adapt WLAN access to continually changing data traffic conditions, and thereby provide QoS by scheduling access times accordingly.

Claims

1. A method for scheduling access times for transmitting data frames from a first transmission point in a WLAN to a second transmission point therein, wherein data frame traffic includes both isochronous streams and asynchronous bursts and is characterized by variations in specified parameter values, the method comprising:

defining a succession of service periods, each service period including a specified number of isochronous epochs;

adapting at least one of the service periods to include at least one asynchronous epoch, each asynchronous epoch immediately following an isochronous epoch of the same service period and each asynchronous epoch is followed by at least one isochronous epoch of the same service period; and

scheduling the access times for the isochronous streams only during the isochronous epochs, and for the asynchronous bursts only during the asynchronous epochs, wherein the lengths of the isochronous and asynchronous epochs fluctuate dependent on the dynamic needs and priorities of user traffic.

2. The method of claim 1 wherein each of the service periods includes two of the isochronous epochs, and further selectively includes one, two or none of the asynchronous epochs.

3. The method of claim 2 wherein said method further comprises incorporating each of the isochronous streams into one of two stream lists, each stream list corresponding to one of a primary access interval of each service period.

4. The method of claim 1 wherein each of the isochronous epochs includes a primary access interval and an extension period, at least one of the isochronous streams being scheduled for access time during each of said primary access intervals, and at least one of the scheduled isochronous streams being provided with additional access time during each of the extension periods.

5. The method of claim 1 wherein each of the isochronous epochs includes a primary access interval and an extension period, the extension period extendable into the next following scheduled isochronous epoch to the extent that sufficient access time is left to accommodate the next following scheduled primary access interval.

6. The method of claim 4 wherein the actual access time during one of the primary intervals starts earlier, but does not end later, than the corresponding scheduled access time, and the amount of access time actually used during one of the extension periods may not exceed the corresponding scheduled access time.

7. The method of claim 1 wherein each of the asynchronous epochs includes an asynchronous burst period and a contention period, at least one of the asynchronous bursts given access time during each of the burst periods.

8. The method of claim 7 wherein each of the asynchronous epochs ends before a scheduled commencement of the next following primary access interval.

9. The method of claim 7 wherein the amount of access time actually used during one of the burst periods does not exceed the corresponding scheduled access time.

10. The method of claim 7 wherein each of the asynchronous bursts is incorporated into a burst list.

11. The method of claim 7 wherein respective asynchronous bursts are allocated access times on the basis of specified weighting values.

12. The method of claim 1 wherein the length of a particular service period is determined from preselected maximum and minimum values, and from specified parameter values for the isochronous streams that are active at the time of determining the particular service period.

13. Apparatus for transmitting data frames from a first transmission point in a WLAN to a second transmission point therein, wherein data frame traffic includes both isochronous streams and asynchronous bursts, the apparatus comprising:

a first component at a first transmission point for scheduling access times to transmit the data traffic during a succession of service periods, each service period including a specified number of isochronous epochs and at least one of the service periods including at least one asynchronous epoch, and each asynchronous is followed by at least one isochronous epoch; and

a second component at the first transmission point acting in cooperation with the first component to successively transmit and receive the isochronous streams during isochronous epochs and asynchronous bursts during asynchronous epochs, wherein the lengths of the isochronous and asynchronous epochs fluctuate dependent on the dynamic needs and priorities of user traffic.

14. The apparatus of claim 13 wherein each of the service periods includes two of the isochronous epochs, and further selectively includes one, two or none of the asynchronous epochs.

15. The apparatus of claim 13 wherein the apparatus further incorporates each of the isochronous streams into one of two stream lists, each stream list corresponding to one of the primary access intervals of each service period.

16. The apparatus of claim 13 wherein each of the isochronous epochs includes a primary access interval and an extension period, at least one of the isochronous streams being scheduled for access time during each of the primary access intervals, and at least one of the scheduled isochronous streams being provided with additional access time during each of the extension periods.

17. The apparatus of claim 13 wherein each of the asynchronous epochs includes an asynchronous burst period and a contention period, at least one of the asynchronous bursts being given access time during each of the burst periods.

18. The apparatus of claim 13 wherein each of the asynchronous epochs ends before commencement of the next following primary access interval.

19. A computer program product embodied in a computer readable medium the execution of which by one or more processors causes the processors to define a succession of service periods, each service period including a specified number of isochronous epochs;

adapt at least one of the service periods to include at least one asynchronous epoch, each asynchronous epoch immediately following an isochronous epoch of the same period and each asynchronous epoch is followed by at least one isochronous epoch of the same service period; and

schedule the access times for the isochronous streams only during the isochronous epochs, and for the asynchronous bursts only during the asynchronous epochs, wherein the lengths of the isochronous and asynchronous epochs fluctuate dependent on the dynamic needs and priorities of user traffic.

20. The program of claim 19 wherein each of the service periods includes two of the isochronous epochs, and further selectively includes one, two or none of the asynchronous epochs.

21. The program of claim 19 further causing processors to incorporate each of the isochronous streams into one of two stream lists, each stream list corresponding to one of a plurality of primary access intervals of each service period.

22. The program of claim 19 wherein each of the isochronous epochs includes one or more primary access intervals, and includes one or more extension periods, at least one of the isochronous streams being scheduled for access time during each of the primary access intervals, and at least one of the scheduled isochronous streams being provided with additional access time during each of the extension periods.

23. The program of claim 19 wherein each of the asynchronous epochs includes an asynchronous burst period and a contention period, at least one of the asynchronous bursts being given access time during each of the burst periods.

24. The program of claim 19 wherein the actual access time during one of a plurality of primary intervals starts earlier, but does not end later, than the corresponding scheduled access time, and the amount of access time actually used during one of a plurality of extension periods does not exceed the corresponding scheduled access time.