Patent US2155877A successfully refreshed from Google Patents.
Patent US5115429A successfully refreshed from Google Patents.
US5115429A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Dynamic encoding rate control minimizes traffic congestion in a packet network
Assignee: Motorola Solutions Inc
•
Filing: 1990-08-02
•
Granted: 1992-05-19
•
Expires: 2010-08-02
Abstract
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.
Inventors
- 👤 Michael G. Hluchyj
- 👤 Nanying Yin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 23:57
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/0001; H04L1/0023; H04L1/0026; H04J; H04J3/00; H04J3/16; H04J3/1682; H04J3/1688; H04L1/0014; H04L12/00; H04L12/64; H04L12/6418; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L1/0015; H04L1/0017; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5614; H04L2012/5616; H04L2012/5629; H04L2012/5631; H04L2012/5632; H04L2012/5635; H04L2012/5638; H04L2012/5671; H04L2012/5678; H04L2012/5681; H04L2012/6481
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
141 words
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.
Claim 2
Independent Claim
141 words
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.
Claim 3
Dependent Claim
97 words
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.
Claim 4
Dependent Claim
52 words
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.
Claim 5
Dependent Claim
24 words
The method according to claim 3 wherein said maintaining step includes maintaining an average queue length measurement of packets flowing through said intermediate nodes.
Claim 6
Dependent Claim
13 words
The method according to claim 1 wherein said bursty traffic comprises voice traffic.
Claim 7
Dependent Claim
13 words
The method according to claim 1 wherein said bursty traffic comprises video traffic.
Claim 8
Dependent Claim
141 words
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.
Claim 9
Dependent Claim
141 words
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.
Claim 10
Dependent Claim
100 words
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.
Claim 11
Dependent Claim
54 words
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.
Claim 12
Dependent Claim
27 words
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.
Claim 13
Dependent Claim
14 words
The packet network according to claim 7 wherein said bursty traffic comprises voice traffic.
Claim 14
Dependent Claim
14 words
The packet network according to claim 7 wherein said bursty traffic comprises video traffic.
References Cited (Backward Citations)
US4074232A
Cited
US4771425A
Cited
US4903261A
Cited
US4779267A
Cited
US4763319A
Cited
US4771391A
Cited
US4816820A
Cited
US4993024A
Cited
US4839891A
Cited
US4890282A
Cited
US4965789A
Cited
US4972411A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-05-19 | 1995-11-18 | 1996-05-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-05-19 | 1999-11-18 | 2000-05-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-05-19 | 2003-11-18 | 2004-05-19 | $7700.00 | Window Closed / Lapsed |