Dynamic encoding rate control minimizes traffic congestion in a packet network

• US 5,115,429 A
• Filed: 08/02/1990
• Issued: 05/19/1992
• Est. Priority Date: 08/02/1990
• Status: Expired due to Term

• Current Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Original Assignee: Codex Corporation (Motorola Solutions, Inc.)
• Inventors: Hluchyj, Michael G., Yin, Nanying
• Primary Examiner(s): Safourek, Benedict V.
• Assistant Examiner(s): HSU, ALPUS
• Application Number:
  US07/561,623
• Time in Patent Office: 656 Days
• Field of Search: 370/94.1, 370/84, 370/60, 370/85.1, 370/85.2, 370/85.3, 370/85.6, 370/110.1, 370/79, 370/94.3, 455/38, 340/825.44, 340/825.5, 340/825.51, 340/825.03, 340/825.04, 341/50, 341/51, 341/61
• US Class Current: 370/231
• CPC Class Codes: H04J 3/1688 the demands of the users being taken into account after redundancy removal, e.g. by predictive coding, by variable sampling reducing bandwidth of signals in general H04B1/66; in PCM-systems H04B14/046; removal of redundancy in telegraph communication H03M7/30
• CPC Class Codes: H04L 1/0014 by adapting the source coding
• CPC Class Codes: H04L 1/0017 where the mode-switching is based on Quality of Service requirement
• CPC Class Codes: H04L 1/0026 Transmission of channel quality indication
• CPC Class Codes: H04L 12/6418 Hybrid transport
• CPC Class Codes: H04L 2012/5616 Terminal equipment, e.g. codecs, synch.
• CPC Class Codes: H04L 2012/5635 Backpressure, e.g. for ABR
• CPC Class Codes: H04L 2012/5671 Support of voice
• CPC Class Codes: H04L 2012/5681 Buffer or queue management
• CPC Class Codes: H04L 2012/6481 Speech, voice
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

This invention is suited for a packet network that carries bursty data. A mechanism is coupled to an edge node for coding bursty information into a digital format at either a first coding rate of a second coding rate which is less than the first rate. A mechanism senses traffic overload of one or more intermediate nodes carrying the bursty informaton. A mechanism which is responsive to the overload sensing mechanism causes the coding mechanism to switch from the first rate to the second rate while a traffic overload is sensed. Thus, network demand requirements are reduced and the overload will be alleviated.

Claims

1. A method for minimizing traffic overload at an edge node in a packet network that carries bursty traffic and includes intermediate nodes through which traffic is routed, the method comprising the steps of:

coding bursty information at one edge node into a digital format for transmission as packets to another edge node, the coding including a first coding rate utilized except during a traffic overload and a second coding rate less than the first rate;

determining at said one edge node if a reverse congestion indicator (RCIB) in the header of a packet sent from said another node is set thereby indicating a traffic overload condition in the transmission path from said one edge node to said another node;

if said RCIB is set, utilizing said second coding rate at said one node to reduce the traffic input into the network.

2. The method according to claim 1 further comprising the steps of:

determining at said one edge node if a forward congestion indicator (FCIB) in the header of a packet sent from said another node is set thereby indicating a traffic overload condition in the transmission path from said another edge node to said one node;

if said FCIB is set, said one edge node setting the RCIB in the header of a packet transmitted from said one edge node to said another edge node thereby communicating a traffic overload in the network to said another edge node.

3. The method according to claim 1 further comprising the steps of:

at each intermediate node maintaining a measurement of traffic loading of packets flowing through said intermediate nodes;

if said measurement exceeds a predetermined level at an intermediate node setting said FCIB in the header of packets passing through said intermediate node.

4. The method according to claim 3 wherein said maintaining step includes maintaining an average queue length measurement of packets flowing through said intermediate nodes.

5. The method according to claim 1 wherein said bursty traffic comprises voice traffic.

6. The method according to claim 1 wherein said bursty traffic comprises video traffic.

7. A packet network that carries bursty traffic and includes edge nodes that input traffic into the network and intermediate nodes through which traffic is routed comprising:

means for coding bursty information at one edge node into a digital format for transmission as packets to another edge node, the coding means including a first coding rate utilized except during a traffic overload and a second coding rate less than the first rate;

means for determining if a reverse congestion indicator (RCIB) in the header of a packet sent from said another node to said one node is set thereby indicating a traffic overload condition in the transmission path from said one edge node to said another node;

if said RCIB is set, said determining means utilizing said second coding rate at said one node to reduce the traffic input into the network.

8. The packet network according to claim 7 further comprising:

means at said edge nodes for determining if a forward congestion indicator (FCIB) in the header of a packet sent from said another node to said one node is set thereby indicating a traffic overload condition in the transmission path from said another edge node to said one node;

if said FCIB is set, said FCIB determining means setting the RCIB in the header of a packet transmitted from said one edge node to said another edge node thereby communicating a traffic overload in the network to said another edge node.

9. The packet network according to claim 7 further comprising:

means at each intermediate node for maintaining a measurement of traffic loading of packets flowing through said intermediate nodes;

means for setting said FCIB in the header of packets passing through intermediate nodes if said measurement exceeds a predetermined level thereby providing a congestion indication.

10. The packet network according to claim 9 wherein said maintaining means includes means for maintaining an average queue length measurement of packets flowing through said intermediate nodes.

11. The packet network according to claim 7 wherein said bursty traffic comprises voice traffic.

12. The packet network according to claim 7 wherein said bursty traffic comprises video traffic.