System and method for aggregation and queuing in a wireless network

• US 8,670,383 B2
• Filed: 01/14/2011
• Issued: 03/11/2014
• Est. Priority Date: 12/28/2006
• Status: Active Grant

• Current Assignee: Trapeze Networks Incorporated (Juniper Networks Incorporated)
• Original Assignee: Trapeze Networks Incorporated (Juniper Networks Incorporated)
• Inventors: Gast, Matthew Stuart, Bennett, Richard Thomas
• Primary Examiner(s): EBRAHIM, ANEZ C
• Application Number:
  US13/006,950
• Publication Number:
  US 20110255466A1
• Time in Patent Office: 1,152 Days
• Field of Search: None
• US Class Current: 370/328
• CPC Class Codes: H04L 47/50 Queue scheduling
• CPC Class Codes: H04L 47/564 Attaching a deadline to packets, e.g. earliest due date first
• CPC Class Codes: H04L 49/90 Buffering arrangements
• CPC Class Codes: H04L 49/9023 for implementing a jitter-buffer
• CPC Class Codes: H04W 72/569 of the traffic information
• CPC Class Codes: H04W 88/08 Access point devices

Abstract

A technique for improved throughput at an access point (AP) involves when frames are received for transmission by the AP, queuing the frames for a particular station. A system constructed according to the technique may include an aggregation and queuing layer. Station queues may be processed by the aggregation and queuing layer before being given to radio hardware for transmission. In an illustrative embodiment, when frames are received by the aggregation and queuing layer, the packet will be assigned a target delivery time (TDT) and an acceptable delivery time (ADT). The TDT is the “ideal” time to transmit a frame, based on its jitter and throughput requirements. Frames are mapped on to a time axis for transmission by TDT. In an illustrative embodiment, each frame is mapped by priority, so that there are separate maps for voice, video, best effort, and background frames. There will be gaps between frames for transmission that can be used for aggregation.

Claims

1. An apparatus implemented in at least one of a memory or a processing device, comprising:

an engine configured to be coupled to at least one ingress queue and at least one output queue,

the engine configured to assign a target delivery time (TDT) to a first packet having a destination, a TDT to a second packet having the destination of the first packet, and a TDT to a third packet having a destination, the first packet, the second packet, and the third packet being in the at least one ingress queue,

if a duration of time, between the TDT of the first packet and the TDT of the third packet, exists such that aggregating and sending the first packet and the second packet results in (1) the first packet being sent before the TDT of the first packet and (2) the third packet being sent before the TDT of the third packet;

the engine configured to (1) aggregate the first packet and the second packet to produce an aggregated packet, (2) enqueue the aggregated packet on the at least one egress queue, and (3) enqueue the third packet, after the aggregated packet, on the at least one egress queue.

2. The apparatus of claim 1, wherein the engine is configured to be coupled to at least one station associated with the at least one ingress queue.

3. The apparatus of claim 1, wherein the engine is configured to be coupled to the at least one ingress queue receiving, from a distribution system, the first packet, the second packet, and the third packet.

4. The apparatus of claim 1, wherein the engine is configured to be coupled to the at least one ingress queues including a plurality of sub-queues associated with packet transmission priorities.

5. The apparatus of claim 1, wherein the at least one egress queue is a plurality of egress queues, the engine is configured to be coupled to the plurality of egress queues, each egress queue from the plurality of egress queues associated with a packet priority from a plurality of packet priorities.

6. The apparatus of claim 1, wherein, the third packet TDT immediately follows the first packet TDT.

7. The apparatus of claim 1, wherein, the first packet TDT immediately follows the third packet TDT.

8. The apparatus of claim 1, wherein the engine is configured to append the second packet to the first packet to produce the aggregated packet.

9. The apparatus of claim 1, wherein the engine is configured to provide data to at least one station data indicating when a medium is predicted to be busy.

10. A non-transitory processor-readable medium storing code representing instructions to be executed by a processor, the code comprising code to cause the processor to:

assign (1) a target delivery time (TDT) to a first packet having a destination, (2) a TDT to a second packet having the destination of the first packet, and (3) a TDT to a third packet having a destination;

determine if a duration of time, between the TDT of the first packet and the TDT of the third packet, exists such that aggregating and sending the first packet and the second packet results in (1) the first packet being sent before the TDT of the first packet and (2) the third packet being sent before the TDT of the third packet; and

when the duration of time exists;

aggregate the first packet and the second packet to produce an aggregated packet;

enqueue the aggregated packet in an egress queue; and

enqueue the third packet, after the aggregated packet, in the egress queue.

11. The non-transitory processor-readable medium storing code representing instructions to be executed by the processor of claim 10, wherein the third packet TDT immediately follows the first packet TDT.

12. The non-transitory processor-readable medium storing code representing instructions to be executed by the processor of claim 10, wherein the first packet TDT immediately follows the third packet TDT.

13. The non-transitory processor-readable medium storing code representing instructions to be executed by the processor of claim 10, the code comprising code to cause a processor to aggregate the first packet and the second packet further includes code to cause the processor to append the second packet to the first packet to produce the aggregated packet.

14. The non-transitory processor-readable medium storing code representing instructions to be executed by the processor of claim 10, the code further comprising code to cause a processor to send data to at least one station indicating when a wireless medium is predicted to be busy.

15. A method, comprising:

receiving a first packet having a destination, a second packet having the destination of the first packet, and third packet having a destination;

assigning (1) a target delivery time (TDT) to the first packet, and (2) a TDT to the third packet; and

if a duration of time, between the TDT of the first packet and the TDT of the third packet, exists such that aggregating and sending the first packet and the second packet results in (1) the first packet being sent before the TDT of the first packet and (2) the third packet being sent before the TDT of the third packet;

enqueueing an aggregated first packet and second packet to produce an aggregated packet; and

enqueueing the third packet after the aggregated packet.

16. The method of claim 15, wherein, the third packet TDT immediately follows the first packet TDT.

17. The method of claim 15, wherein, the first packet TDT immediately follows the third packet TDT.

18. The method of claim 15, wherein enqueueing the aggregated packet includes appending the second packet to the first packet.

19. The method of claim 15, further comprising sending data to at least one station indicating when a wireless medium is predicted to be busy.

20. The method of claim 15, wherein receiving the first packet includes receiving the first packet from at least one ingress queue including a plurality of sub-queues associated with packet transmission priorities.