Transmission congestion control method and apparatus

• US 5,048,013 A
• Filed: 04/06/1990
• Issued: 09/10/1991
• Est. Priority Date: 04/06/1990
• Status: Expired due to Term

• Current Assignee: American Telephone & Telegraph Company (AT&T, Inc.)
• Original Assignee: AT&T, Inc.
• Inventors: Eng, Kai Y., Gitlin, Richard D., Karol, Mark J.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): TON, DANG T
• Application Number:
  US07/505,796
• Time in Patent Office: 522 Days
• Field of Search: 370/112, 370/79, 370/85.6, 370/94.1, 370/94.2, 370/60, 370/60.1, 370/58.1, 370/58.2, 370/91, 370/58.3, 370/61, 379/273, 379/221, 340/825.08, 375/118
• US Class Current: 370/229
• CPC Class Codes: H04J 3/1682 Allocation of channels according to the instantaneous demands of the users, e.g. concentrated multiplexers, statistical multiplexers
• CPC Class Codes: H04J 3/247 ATM or packet multiplexing

Abstract

A congestion control method and apparatus for use with a communications link comprising a plurality of N channels. A plurality of at most N-1 queues are sequentially polled, and data is output therefrom to the communications link, thereby leaving at least one remaining channel. After the at most N-1 queues are polled, a determination is made as to which of the at most N-1 queues is closest to a data overflow condition. The remaining at least one channel is then utilized to transmit data from the queues which are closest to overflow.

Claims

1. In an apparatus for generating a plurality of N communications channels, and including a plurality of at most N-1 queues, a method of controlling transmission congestion comprising the steps of:

(a) polling one of the queues, and transmitting data therefrom on an associated separate one of the N channels during such time when the queue is polled;

(b) repeating step (a) for each of the plurality of at most N-1 queues, thereby leaving at least one remaining channel;

(c) determining at least one queue which has the most data stored therein relative to the other queues and outputting data therefrom on said at least one remaining channel; and

(d) repeating steps (a) through (c).

2. The method of claim 1 wherein the communications link is a fiber optic communications link.

3. The method of claim 1 wherein the step (c) of determining and outputting comprises:

monitoring a fullness associated with each queue;

recording an address associated with a queue which is most full;

generating a control signal in response to the recorded address;

transmitting the control signal to a switch; and

switching data from the queue associated with the recorded address to the communications link via the switch.

4. Apparatus for generating a plurality of N communications channels, the apparatus being adapted for connection to a communications link, comprising:

a plurality of at most N-1 queues;

means for sequentially polling said queues and for outputting data from each queue on an associated separate one of said N communications channels during such time when said queue is polled, thereby leaving at least one remaining communications channel;

means for monitoring each of said queues to determine at least one of said queues which has the most data stored therein relative to the other queues; and

means for switching data from said at least one queue which has the most data stored therein to said means for sequentially polling and for outputting, thereby causing data from said at least one queue which has the most data stored therein to be output on said at least one remaining channel.

5. The apparatus of claim 4 wherein said communications link is a fiber optic communications link.

6. The apparatus of claim 4 wherein the means for monitoring includes means for monitoring a fullness associated with each queue, and for recording an address associated with a queue which is most full.

7. The apparatus of claim 6 wherein the means for sequentially polling comprises a Time Division Multiplexer, the Time Division Multiplexer including a plurality of outputs, each output arranged to receive data from a separate one of the N-1 queues.

8. The apparatus of claim 5 wherein the means for monitoring includes means for monitoring a fullness associated with each queue, and for recording an address associated with a queue which is most full.

9. The apparatus of claim 8 wherein the means for sequentially polling comprises a Time Division Multiplexer, the Time Division Multiplexer including a plurality of outputs, each output arranged to receive data from a separate one of the N-1 queues.