Dynamic queue length thresholds in a shared memory ATM switch

• US 5,541,912 A
• Filed: 10/04/1994
• Issued: 07/30/1996
• Est. Priority Date: 10/04/1994
• Status: Expired due to Term

• Current Assignee: AT&T Corporation (AT&T, Inc.)
• Original Assignee: AT&T Corporation (AT&T, Inc.)
• Inventors: Choudhury, Abhijit K., Hahne, Ellen L.
• Primary Examiner(s): Hsu, Alpus H.
• Application Number:
  US08/318,007
• Time in Patent Office: 665 Days
• Field of Search: 370/13, 370/17, 370/60, 370/60.1, 370/61, 370/85.2, 370/85.6, 370/94.1, 370/94.2, 370/118, 340/825.5, 340/825.51, 340/825.52, 395/425
• US Class Current: 370/412
• CPC Class Codes: H04L 12/5601 Transfer mode dependent, e.g. ATM
• CPC Class Codes: H04L 2012/5651 Priority, marking, classes
• CPC Class Codes: H04L 2012/5681 Buffer or queue management
• CPC Class Codes: H04L 2012/5682 Threshold; Watermark
• CPC Class Codes: H04L 49/108 using shared central buffer

Abstract

A dynamic threshold system and method is disclosed for allocating memory among different output queues in a shared-memory ATM switch. The maximum permissible length for any individual queue at any instant of time is a function of the unused buffering in the switch. The dynamic threshold system and method deliberately reserves a small amount of buffer space, not allocating it to any currently active output queue, but attempts to equally share the remaining buffer space among the currently active output queues. The dynamic threshold system and method improve fairness and switch efficiency by guaranteeing access to the buffer space for all output queues, and by preventing any single output queue from monopolizing the memory at the expense of the others. The dynamic threshold system and method adapt to uncertain or changing load conditions. The packet losses that occur with dynamic thresholds tend to be clustered at a few offending queues, which is desirable in ATM systems, since it results in fewer messages being disturbed at higher protocol layers and, hence, fewer message retransmissions. The dynamic threshold system and method are also extendable to handle traffic with multiple space priorities.

Claims

1. A packet communications system comprising:

a packet processing circuit for processing packets as incoming and outgoing packets, for receiving an incoming packet on an input port and for transmitting an outgoing packet on an output port, with the packets belonging to at least one space priority class and to at least one scheduling class;

a memory for storing the processed packets in queues; and

a processor using control logic and configured for controlling the packet processing circuit to process the packets and for allocating memory among the queues by computing an availability value based on the occupancy of the memory, by computing a control parameter as a function of the availability value, by computing the lengths of the queues, and by controlling admittance of each incoming packet to its queue based on the length of the queue being less than the control parameter.

2. The packet communications system of claim 1 wherein the packet processing circuit processes packets of variable lengths.

3. The packet communications systems of claim 1 wherein the packet processing circuit processes packets of fixed lengths.

4. The packet communications system of claim 1 wherein the packets are asynchronous transfer mode (ATM) cells.

5. The packet communications system of claim 1 wherein the packet processing circuit is connected to a plurality of input ports;

and

the processor controls the packet processing circuit to perform packet multiplexing functions.

6. The packet communications system of claim 1 wherein the packet processing circuit is connected to a plurality of output ports;

and

the processor controls the packet processing circuit to perform packet demultiplexing functions.

7. The packet communications system of claim 1 wherein the packet processing circuit is connected to a plurality of input ports and a plurality of output ports;

and

the processor controls the packet processing circuit to perform switching functions.

8. The packet communications system of claim 1 wherein the queue of the incoming packet includes packets destined for the same output port as the incoming packet.

9. The packet communications system of claim 1 wherein the queue of the incoming packet includes packets destined for the same output port as the incoming packet and having the same priority class as the incoming packet.

10. The packet communications system of claim 1 wherein the queue of the incoming packet includes packets destined for the same output port as the incoming packet and having one of the same space priority class as in the incoming packet and a space priority class with a higher priority according to a predetermined order than the incoming packet.

11. The packet communications system of claim 1 wherein the queue of the incoming packet includes packets destined for the same output port as the incoming packet and having the same scheduling class as the incoming packet.

12. The packet communications system of claim 1 wherein the queue of the incoming packet includes packets that arrived over the same input port as the incoming packet.

13. The packet communications system of claim 1 wherein the processor uses the control parameter as a threshold, and the processor denies the incoming packet admission to its queue if the length of the queue equals or exceeds the control parameter.

14. The packet communications system of claim 13 wherein the processor includes a comparator for determining whether the queue length equals or exceeds the control parameter.

15. The packet communications system of claim 1 wherein the processor computes the control parameter to be at least one of the availability value, a multiple of the availability value, and a fraction of the availability value.

16. The packet communications system of claim 15 wherein the particular multiple and fraction used depends on the space priority of the incoming packet.

17. The packet communications system of claim 15 wherein the multiple and fraction is a positive and negative integer power of 2, respectively.

18. The packet communications system of claim 17 wherein the processor includes a shift register for determining the product of the power of 2 and the availability value.

19. The packet communications system of claim 1 wherein the processor computes the availability value as the difference between a measure of effective buffer capacity and a measure of memory occupancy.

20. The packet communications system of claim 19 wherein the measure of effective buffer capacity depends on the space priority of the incoming packet.

21. The packet communications system of claim 19 wherein the measure of memory occupancy depends on the space priority of the incoming packet.

22. The packet communications system of claim 21 wherein the measure of memory occupancy is the number of packets in the memory with the same space priority class as the incoming packet.

23. The packet communications system of claim 21 wherein the measure of memory occupancy is the number of packets in the memory with at least one of the same space priority class as the incoming packet and a space priority class with a higher priority according to a predetermined order than the incoming packet.

24. A method for allocating memory space among queues in a packet communications system, the queues including packets of at least one space priority class and of at least one scheduling class, the method comprising the steps of:

maintaining counts of the lengths of the queues;

maintaining an availability value associated with the occupancy of the memory, and a control parameter that is a function of the availability value;

processing an incoming packet including at least one of the steps of admitting the incoming packet to its queue and rejecting the incoming packet according to the condition of the length of the queue being less than the control parameter.

25. The method of claim 24 wherein the step of processing includes processing asynchronous transfer mode (ATM) cells as the incoming packets.

26. The method of claim 24 including the step of associating the queue of the incoming packet with the space priority class of the incoming packet.

27. The method of claim 24 including the step of associating the queue of the incoming packet with the scheduling class of the incoming packet.

28. The method of claim 24 including the step of updating the length count of any queue immediately whenever the step of processing admits or removes a packet from the queue.

29. The method of claim 24 wherein the step of maintaining an availability value includes the step of maintaining an amount of unused memory as the availability value.

30. The method of claim 24 including the step of setting the control parameter equal to at least one of the availability value, a fraction of the availability value, and a multiple of the availability value.

31. The method of claim 24 including the step of associating the control parameter with the space priority class of the incoming packet.

32. The method of claim 24 wherein the step of admitting uses the control parameter as a threshold on the queue length of the incoming packet, and the step of rejecting is performed if the queue length equals or exceeds the control parameter.

33. The method of claim 24 including the step of updating the availability value and the control parameter immediately whenever the step of processing admits or removes a packet from the memory.

34. The method of claim 24 wherein the steps of admitting and rejecting the incoming packet includes the steps of:

receiving the incoming packet;

determining the space priority class of the incoming packet;

determining the scheduling class of the incoming packet;

determining the queue that the packet would join;

determining the length of the queue;

determining the control parameter;

making an admission decision whether or not to admit the incoming packet to its queue; and

storing the incoming packet in its queue in the memory if the admission decision is favorable.

35. A packet communications module comprising:

a packet processing circuit for processing packets as incoming and outgoing packets to receive an incoming packet on an input port and to transmit an outgoing packet on an output port;

a memory for storing the processed packets in an output port queue associated with the output port;

a processor using stored programs and configured for controlling the packet processing circuit to process the packets, for computing availability values based on the total occupancy of the memory, for computing control parameters as functions of the availability values, for computing an output port queue length, and for controlling admittance of packets to the output port queue based on the output port queue lengths being less than corresponding control parameters to allocate memory space in the memory for admitted packets.

36. A system for allocating memory space in an asynchronous transfer mode (ATM) switch for switching ATM packets, the system comprising:

the ATM switch for processing ATM packets as incoming and outgoing ATM packets to receive incoming ATM packets on a plurality of input ports and to transmit outgoing ATM packets on a plurality of output ports;

a memory for storing the processed ATM packets in an output port queue;

a processor having associated memory and using stored programs and configured for controlling the ATM switch to process the ATM packets, for computing availability values based on the total occupancy of the memory, for computing control parameters as functions of the availability values, for computing an output port queue length, and for controlling admittance of ATM packets to the output port queue based on the output port queue lengths being less than corresponding control parameters to allocate memory space in the memory for admitted ATM packets.

37. A method for allocating memory space in a shared memory of an asynchronous transfer mode (ATM) switch, the method comprising the steps of:

receiving an packet;

determining a control parameter as a function of an occupancy value of the shared memory; and

storing the packet in a queue in the memory based on a queue length of the queue being less than the control parameter.

38. A method for allocating memory space among a plurality of output queues in a shared memory of an asynchronous transfer mode (ATM) switch module, the method comprising the steps of:

determining a first count from an occupancy of the shared memory;

receiving an ATM packet from an input port;

determining a priority setting of the received packet;

determining a first queue length of the first queue corresponding to the priority setting;

storing the ATM packet in the shared memory responsive to the condition of the first queue length being less than a predetermined multiple of the first count.