Flow control technique for X.25 traffic in a high speed packet switching network

• US 6,167,027 A
• Filed: 09/23/1997
• Issued: 12/26/2000
• Est. Priority Date: 09/09/1997
• Status: Expired due to Term

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Legoll, Jean-Jacques, Aubert, Denis, Chabannet, Anne, Mariotti, Rene, Plattier, Edmond, Szczap, Michel
• Primary Examiner(s): Kizou, Hassan
• Assistant Examiner(s): SLAVITT, MITCHELL R
• Application Number:
  US08/935,758
• Time in Patent Office: 1,190 Days
• Field of Search: 370/230, 370/231, 370/232, 370/233, 370/234, 370/235, 370/237, 370/389
• US Class Current: 370/230
• CPC Class Codes: H04L 12/2854 Wide area networks, e.g. public data networks
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/29 using a combination of thresholds

Abstract

A preventive X.25 flow control mechanism for use in a high speed packet switching network where calls are multiplexed on network trunks with each connection using a reserved amount of the total bandwidth. X.25 data terminal equipments access the network via access nodes. Each access node includes a Leaky Bucket component which maintains a refillable token pool. Each time an incoming packet is received by the leaky bucket component, the number of available tokens is compared to two predetermined threshold values. If the number of tokens is less than the low threshold, acknowledgments of received packets are stopped, inducing an interruption of packets transmitted by the emitting attached X.25 terminals. Interrupting packet transmission will lead to a regeneration of the number of tokens in the token pool. If the number of tokens reaches the high threshold, acknowledgments are again generated to restore packet transmissions. The first and second thresholds are greater than zero, reducing the chances that a packet will be marked as being discardable.

Claims

1. A method for controlling X.25 data traffic at an access node of a packet switching network, said X.25 data traffic being provided from sources which continue to transmit traffic only where acknowledgments of previously-transmitted traffic are received on a predetermined basis, said access node implementing a leaky bucket admission control mechanism in which tokens are added to a pool at a predetermined rate, said method comprising the steps of:

receiving and temporarily storing each incoming packet;

testing the number of tokens available in the token pool against first and second thresholds having values greater than zero;

where the test reveals the number of available tokens is less than the first threshold and packet acknowledgments are being provided to the packet source, discontinuing such acknowledgments;

where the number of available tokens is greater than a second threshold and acknowledgments are not being provided to the packet source, resuming acknowledgments of received packets; and

transmitting the stored packet and decrementing the token pool.

2. The method set forth in claim 1 wherein the second threshold is greater than the first threshold.

3. The method set forth in claim 1 wherein the first and second thresholds have the same value.

4. The method as set forth in claim 2 wherein the first threshold is set to a value less than 50% of the maximum number of tokens in the token pool and the second threshold is set to a value greater than 50% of the maximum number of tokens in the token pool.

5. The method set forth in claim 4 wherein the first threshold is set to 25 percent of the maximum number of tokens in the token pool and the second threshold is set to 75 percent of the maximum number of tokens in the token pool.

6. A method for controlling X.25 data traffic at an access node of a packet switching network, said X.25 data traffic being provided from sources which continue to transmit traffic only where acknowledgements of previously-transmitted traffic are received on a predetermined basis, said access node implementing a leaky bucket admission control mechanism in which tokens are added to a token pool at a predetermined rate, said method comprising:

receiving and temporarily storing each incoming packet in a packet buffer;

comparing for testing the number of tokens available in the token pool against first and second thresholds having values greater than zero;

using acknowledgement controlling logic which is responsive where the test reveals the number of available tokens is less than the first threshold and packet acknowledgements are being provided to the packet source to discontinue generating such acknowledgements and which is responsive where the number of available tokens is greater than a second threshold and acknowledgements are not being provided to the packet source, for resuming generation of such acknowledgements;

transmitting the packet stored in the buffer; and

decrementing the token pool by using logic which is responsive to transmission of the packet.

7. The method set forth in claim 6 wherein the first and second thresholds have the same value.

8. The system as set forth in claim 6 wherein the first threshold is set to a value less than 50% of the maximum number of tokens in the token pool and the second threshold is set to a value greater than 50% of the maximum number of tokens in the token pool.

9. The system set forth in claim 8 wherein the first threshold is set to 25 percent of the maximum number of tokens in the token pool and the second threshold is set to 75 percent of the maximum number of tokens in the token pool.

10. A system for controlling X.25 data traffic at an access node of a packet switching network, said X.25 data traffic being provided from sources which continue to transmit traffic only where acknowledgements of previously-transmitted traffic are received on a predetermined basis, said access node implementing a leaky bucket admission control mechanism in which tokens are added to a token pool at a predetermined rate, said system comprising:

a packet buffer for receiving and temporarily storing each incoming packet;

a comparator for testing the number of tokens available in the token pool against first and second thresholds having values greater than zero;

acknowledgement controlling logic which is responsive where the test reveals the number of available tokens is less than the first threshold and packet acknowledgements are being provided to the packet source to discontinue generating such acknowledgements and which is responsive where the number of available tokens is greater than a second threshold and acknowledgements are not being provided to the packet source, for resuming generation of such acknowledgements;

means for transmitting the packet stored in the buffer; and

means for decrementing the token pool by using logic which is responsive to transmission of the packet.

11. The system set forth in claim 10 wherein the first and second thresholds have the same values.

12. The system as set forth in claim 10 wherein the first threshold is set to a value less than 50% of the maximum number of tokens in the token pool and the second threshold is set to a value greater than 50% of the maximum number of tokens in the token pool.

13. The system set forth in claim 12 wherein the first threshold is set to 25 percent of the maximum number of tokens in the token pool and the second threshold is set to 75 percent of the maximum number of tokens in the token pool.