← Back to Patent Explorer
US5889762A Expired / Lapsed US ⏱️ 0.0 years remaining

Control of overload situations in frame relay network which discards the contents of a virtual-channel-specific buffer when said buffer is full

Assignee: Nokia Technologies Oy
•
Filing: 1994-11-29
•
Granted: 1999-03-30
•
Expires: 2014-11-29
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention relates to a method for congestion management in an FR network. The method comprises determining the virtual channel associated with a frame to be transmitted when it is received from a subscriber connection at a subscriber node. In order for the load in the network to be reduced, (a) data is buffered at the input boundary of the subscriber node to virtual-channel-specific buffers (62 1 . . . 62 n ), (b) the fill rate of said buffers is monitored continuously, and (c) when a frame is received in a virtual-channel-specific buffer which is full, substantially all the contents of the buffer are discarded.

Inventors

  • 👤 Juha Pajuvirta
  • 👤 Heikki Salovuori
  • 👤 Jorma Matkaselka
  • 👤 Mika Kasslin
  • 👤 Seppo Pyhalammi
  • 👤 Mikko Olkkonen
  • 👤 Richard Fehlmann
  • 👤 Mikko Laiho

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 20:59
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/24; H04L47/2441; H04L47/12; H04L47/16; H04L47/30

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 115 words
A method for congestion management in an frame relay network comprising subscriber nodes to which subscribers (A . . . E) are connected over data links (14a . . . 14e), said method comprising determining the virtual channel associated with a frame (39) to be transmitted when it is received from a subscriber connection at a subscriber node, characterized in that data is buffered at the input boundary of a subscriber node to virtual-channel-specific buffers (62 1 . . . 62 n ) . the fill rate of said buffers is monitored continuously, and when a frame is received in a virtual-channel-specific buffer which is full, substantially all the contents of the buffer are discarded.
Claim 2
Independent Claim 115 words
A method for congestion management in an frame relay network comprising subscriber nodes to which subscribers (A . . . E) are connected over data links (14a . . . 14e), said method comprising determining the virtual channel associated with a frame (39) to be transmitted when it is received from a subscriber connection at a subscriber node, characterized in that data is buffered at the input boundary of a subscriber node to virtual-channel-specific buffers (62 1 . . . 62 n ) . the fill rate of said buffers is monitored continuously, and when a frame is received in a virtual-channel-specific buffer which is full, substantially all the contents of the buffer are discarded.
Claim 3
Dependent Claim 45 words
A method according to claim 1, characterized in that the length of the virtual-channel-specific buffer (62 1 . . . 62 n ) is adjusted to correspond substantially to the length of the frame packet sent at a time by an application using the network.
Claim 4
Dependent Claim 121 words
A subscriber node of a frame relay network, to which node subscribers (A . . . E) of the network are connected over data links (14a . . . 14e), said node comprising input buffers at the input boundary of the node, and output buffers at the output boundary of the node, and means (16) for relaying frames from a input buffer to a desired output buffer, characterized in that it comprises virtual-channel-specific buffers (62 1 . . . 62 n ) at the input boundary, first means (61) for monitoring the fill rate of said virtual-channel-specific buffers, and second means (61) responsive to said first means (61) and to the frame received for discarding the contents of a virtual-channel-specific buffer.
Claim 5
Dependent Claim 121 words
A subscriber node of a frame relay network, to which node subscribers (A . . . E) of the network are connected over data links (14a . . . 14e), said node comprising input buffers at the input boundary of the node, and output buffers at the output boundary of the node, and means (16) for relaying frames from a input buffer to a desired output buffer, characterized in that it comprises virtual-channel-specific buffers (62 1 . . . 62 n ) at the input boundary, first means (61) for monitoring the fill rate of said virtual-channel-specific buffers, and second means (61) responsive to said first means (61) and to the frame received for discarding the contents of a virtual-channel-specific buffer.
Claim 6
Dependent Claim 48 words
A subscriber node according to claim 1, characterized in that said first and second means are provided at the same identification and control unit (61), through which the frames received at the subscriber node are supplied to the virtual-channel-specific buffers (62 1 . . . 62 n ).

References Cited (Backward Citations)

US5140584A Cited
US5163046A Cited
US5231633A Cited
WO1992007438A1 Cited
EP0499150A1 Cited
US5233606A Cited
EP0544452A2 Cited
WO1993014605A1 Cited
US5521923A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-03-29 2002-09-28 2003-03-30 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-03-29 2006-09-28 2007-03-30 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-03-29 2010-09-28 2011-03-30 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag