RANDOM MEDIUM ACCESS METHODS WITH BACKOFF ADAPTATION TO TRAFFIC

• US 20080013567A1
• Filed: 09/24/2007
• Published: 01/17/2008
• Est. Priority Date: 01/02/2001
• Status: Active Grant

• Current Assignee: AT&T Intellectual Property I LP (AT&T, Inc.)
• Original Assignee: AT&T Corporation (AT&T, Inc.)
• Inventors: BENVENISTE, MATHILDE
• Granted Patent: US 7,664,132 B2
• Time in Patent Office: Days
• US Class Current: 370/447
• CPC Class Codes: H04L 12/4013 Management of data rate on the bus systems modifying transmission characteristics according to link quality H04L1/0001
• CPC Class Codes: H04L 12/4015 by scheduling the transmission of messages at the communication node
• CPC Class Codes: H04L 12/413 with random access, e.g. carrier-sense multiple-access with collision detection [CSMA-CD]
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/2416 Real-time traffic
• CPC Class Codes: H04L 47/2433 Allocation of priorities to traffic types
• CPC Class Codes: H04W 28/0231 based on communication conditions dynamic wireless traffic scheduling definition based on channel quality criteria H04W72/54
• CPC Class Codes: H04W 28/0284 detecting congestion or overload during communication monitoring arrangements H04L43/00
• CPC Class Codes: H04W 56/00 Synchronisation arrangements
• CPC Class Codes: H04W 72/54 based on quality criteria
• CPC Class Codes: H04W 72/569 of the traffic information
• CPC Class Codes: H04W 74/02 Hybrid access
• CPC Class Codes: H04W 74/0841 with collision treatment
• CPC Class Codes: H04W 74/085 collision avoidance
• CPC Class Codes: H04W 8/04 Registration at HLR or HSS [Home Subscriber Server]
• CPC Class Codes: H04W 84/12 WLAN [Wireless Local Area Networks]

Abstract

Using low PF values in conjunction with traffic-adapted contention windows leads to substantial decreases in delay and jitter. In general, adaptation to traffic reduces contention or delay: opening up the contention window in congestion and closing it on relief. Residual backoff adaptation provides for the reduction of the already decremented backoff values of stations that interrupted the backoff countdown process due to a transmission. It is good to adapt both the contention window and the residual backoff in order to avoid jitter. Otherwise, if the contention window is reduced but residual backoffs stay unchanged, new arrivals will enjoy shorter backoff delays than older ones, resulting in greater jitter. Adjusting both preserves the relative ordering of backoff counter values, which implies also some form of age ordering. Different adjustments can be applied to different priority traffic.

Claims

1. A method for a distributed medium access protocol that schedules transmission of different types of packets on a channel based on a service quality specification for each type of packet, comprising the steps of:

determining at a plurality of nodes in a network, an urgency class for each of a plurality of pending packets according to a scheduling algorithm;

transmitting pending packets in a given urgency class before transmitting packets of a lower urgency class;

remembering a number of transmission attempts by a node for a last transmission of same node;

estimating from said number of transmission attempts a current congestion level that is experienced; and

adjusting a backoff counter to the current congestion level to provide a dispersion of packet traffic bursts.

2. The method for a distributed medium access protocol of claim 1, which further comprises:

broadcasting with each transmission the number of transmission attempts by a node;

estimating from said number of transmission attempts received from other nodes the current congestion level that is experienced; and

adjusting a backoff counter to the current congestion level to provide a dispersion of packet traffic bursts.

3. The method for a distributed medium access protocol of claim 1, which further comprises:

broadcasting with each transmission the number of transmission attempts by a node;

estimating from said number of transmission attempts received from other nodes the current congestion level that is experienced; and

adjusting a backoff counter to the current congestion level to provide a dispersion of packet traffic bursts.

4. The method for a distributed medium access protocol of claim 1, which further comprises:

remembering the number of transmission attempts for packets of every urgency class by a node for the last transmission in that class of same node;

estimating from said number of transmission attempts the current congestion that is experienced by the urgency class of a pending packet; and

adjusting a backoff counter for the pending packet to the current congestion level to provide a dispersion of packet traffic bursts.

5. The method for a distributed medium access protocol of claim 1, which further comprises:

broadcasting with each transmission the number of transmission attempts by a node and the assigned urgency class;

estimating from said number of transmission attempts received from other nodes the current congestion level that is experienced by the urgency class of the pending packet; and

adjusting a backoff counter of the pending packet to the current congestion level to provide a dispersion of packet traffic bursts.

6. The method for a distributed medium access protocol of claim 1, which further comprises:

broadcasting with each transmission the number of transmission attempts by a node and the assigned urgency class;

estimating from said number of transmission attempts received from other nodes the current congestion level that is experienced by the urgency class of the pending packet; and

adjusting a backoff counter of the pending packet to the current congestion level to provide a dispersion of packet traffic bursts.

7. The method for a distributed medium access protocol of claim 1, which further comprises:

initializing backoff counters with a relatively longer value, and then decreasing the value upon transmission failure and retrial.

8. The method for a distributed medium access protocol of claim 1, which further comprises:

remembering the number of transmission attempts by a node for the last transmission of same node;

estimating from said number of transmission attempts the current congestion level that is experienced; and

adjusting a persistence probability to current congestion level to provide a dispersion of packet traffic bursts.

9. The method for a distributed medium access protocol of claim 1, which further comprises:

broadcasting with each transmission the number of transmission attempts by a node;

estimating from said number of transmission attempts received from other nodes the current congestion level that is experienced; and

adjusting a persistence probability to the current congestion level to provide a dispersion of packet traffic bursts.

10. The method for a distributed medium access protocol of claim 1, which further comprises:

broadcasting with each transmission the number of transmission attempts by a node;

estimating from said number of transmission attempts received from other nodes the current congestion level that is experienced; and

adjusting a persistence probability to current congestion level to provide a dispersion of packet traffic bursts.

11. The method for a distributed medium access protocol of claim 1, which further comprises:

remembering the number of transmission attempts for packets of every urgency class by a node for the last transmission in that class of same node;

estimating from said number of transmission attempts the current congestion level that is experienced by the urgency class of a pending packet; and

adjusting a persistence probability for the pending packet to current congestion level to provide a dispersion of packet traffic bursts.

12. The method for a distributed medium access protocol of claim 1, which further comprises:

broadcasting with each transmission the number of transmission attempts by a node and the assigned urgency class;

estimating from said number of transmission attempts received from other nodes the current congestion level that is experienced by the urgency class of the pending packet; and

adjusting a persistence probability of the pending packet to current congestion level to provide a dispersion of packet traffic bursts.

13. The method for a distributed medium access protocol of claim 1, which further comprises:

broadcasting with each transmission the number of transmission attempts by a node and the assigned urgency class;

estimating from said number of transmission attempts received from other nodes the current congestion level that is experienced by the urgency class of the pending packet; and

adjusting a persistence probability of the pending packet to current congestion levels to provide a dispersion of packet traffic bursts.

14. The method for a distributed medium access protocol of claim 1, which further comprises:

initializing a persistence probability with a relatively lower value, and then increasing the value upon transmission failure and retrial.

15. The method for a distributed medium access protocol of claim 1, which further comprises:

establishing criteria for cancellation of transmission of a packet associated with packet delay.

16. The method for a distributed medium access protocol of claim 1, which further comprises:

applying backoff prior to attempting any transmission.

17. The method for a distributed medium access protocol of claim 1, which further comprises:

checking for permission to transmit by using a specified persistence probability prior to attempting any transmission.

18. The method for a distributed medium access protocol of claim 1, wherein said network is a wireless network.

19. The method for a distributed medium access protocol of claim 1, wherein said network is a cellular packet network.

20. The method for a distributed medium access protocol of claim 1, wherein said network comprises one or more multi-channel air interface systems in accordance with at least one of:

FDMA, TDMA, OFDM, or CDMA.