US5638359A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for congestion management in a frame relay network and a node in a frame relay network
Assignee: Vringo Infrastructure Inc
•
Filing: 1993-12-14
•
Granted: 1997-06-10
•
Expires: 2013-12-14
Abstract
Abstract A method for congestion management in a frame relay network, in which a virtual channel associated with a frame to be transferred is determined. In other to provide a congestion management method which is reliable and capable of rapid responding and which allows even virtual connections to be prioritized with respect to the throughput probability, (a) at least some of the virtual channels are assigned a respective service level; (b) a congestion level having values in a predetermined relationship to the values of the service levels is determined for a network resource liable to congestion; (c) the value representing the service level of the virtual channel of the FR frame (39) is compared with the value representing the congestion level of the network resource; and (d) when the result of the comparison falls outside a predetermined value range, the frame is discarded.
Inventors
- 👤 Tero Peltola
- 👤 Jorma Matakselka
- 👤 Esa Harju
- 👤 Heikki Salovuori
- 👤 Jukka Keskinen
- 👤 Kari Makinen
- 👤 Olli Roikonen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 22:51
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/24; H04L47/2425; H04L47/2433; H04L47/12; H04L47/16; H04L47/32; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5614; H04L2012/5615; H04L2012/5629; H04L2012/5631; H04L2012/5632; H04L2012/5636; H04L2012/5638; H04L2012/5645
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
124 words
A method for managing congestion in a frame relay network, comprising the steps of: determining a plurality of virtual channels associated with respective frames to be transferred over the frame relay network; assigning respective service levels, having values, for at least some of said virtual channels; determining a congestion level having a varying value in a predetermined relationship to the values of the service levels, for a network resource liable to congestion; for each frame to be transferred, comparing the value representing the respective service level of the respective virtual channel of the respective frame, with the value representing the corresponding existing congestion level of said resource; and discarding each respective frame when the result of the comparison falls outside a predetermined value range.
Claim 2
Independent Claim
124 words
A method for managing congestion in a frame relay network, comprising the steps of: determining a plurality of virtual channels associated with respective frames to be transferred over the frame relay network; assigning respective service levels, having values, for at least some of said virtual channels; determining a congestion level having a varying value in a predetermined relationship to the values of the service levels, for a network resource liable to congestion; for each frame to be transferred, comparing the value representing the respective service level of the respective virtual channel of the respective frame, with the value representing the corresponding existing congestion level of said resource; and discarding each respective frame when the result of the comparison falls outside a predetermined value range.
Claim 3
Dependent Claim
19 words
The method according to claim 1, wherein: all of said virtual channels are assigned a respective said service level.
Claim 4
Dependent Claim
40 words
The method according to claim 1, wherein: all FR frames having a DE bit thereof set, are assigned the lowest of said service level values, irrespective of the service level of the virtual channel to which the respective frame belongs.
Claim 5
Dependent Claim
24 words
The method according to claim 1, wherein: identical numerical values are used as said service level values and the corresponding said congestion level values.
Claim 6
Dependent Claim
49 words
The method according to claim 1, wherein: said resource liable to congestion is a buffer memory, and said level of congestion is determined by utilizing a congestion level table comprising two buffer memory fill rate thresholds for each congestion level, one for rising congestion, and another for falling congestion.
Claim 7
Dependent Claim
89 words
A node in a frame relay network, comprising: a buffer; means for storing service level values corresponding to virtual channels; means for determining a varying congestion level of a resource of the frame relay network which is liable to congestion; means for comparing values representing the existing congestion level of said resource and the corresponding value representing the service level to obtain respective results; and means for discarding a respective frame arranged to be transferred over the frame relay network, in response to the respective result of said comparison.
Claim 8
Dependent Claim
89 words
A node in a frame relay network, comprising: a buffer; means for storing service level values corresponding to virtual channels; means for determining a varying congestion level of a resource of the frame relay network which is liable to congestion; means for comparing values representing the existing congestion level of said resource and the corresponding value representing the service level to obtain respective results; and means for discarding a respective frame arranged to be transferred over the frame relay network, in response to the respective result of said comparison.
References Cited (Backward Citations)
US5140584A
Cited
US5132966A
Cited
EP0422717A1
Cited
US5014265A
Cited
US5267232A
Cited
US5121383A
Cited
US5251209A
Cited
GB2261798A
Cited
US5303237A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-06-09 | 2000-12-09 | 2001-06-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-06-09 | 2004-12-09 | 2005-06-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-06-09 | 2008-12-09 | 2009-06-10 | $7700.00 | Window Closed / Lapsed |