Congestion avoidance on communications networks

Patent 6430155 Issued on August 6, 2002. Estimated Expiration Date:

November 30, 2018. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Abstract Claims Description Full Text

Patent References

Method and apparatus for implementing communication service contract using cell arrival information
Patent #: 5570360
Issued on: 10/29/1996
Inventor: Klausmeier, et al.

Flow control algorithm for high speed networks
Patent #: 5748901
Issued on: 05/05/1998
Inventor: Afek, et al.

System and method for providing dynamically alterable computer clusters for message routing
Patent #: 5918017
Issued on: 06/29/1999
Inventor: Attanasio, et al.

Method and apparatus for dynamically shifting between routing and switching packets in a transmission network
Patent #: 5920705
Issued on: 07/06/1999
Inventor: Lyon, et al.

Flow and congestion control in packet switched networks
Patent #: 6061330
Issued on: 05/09/2000
Inventor: Johansson

Explicit rate congestion control system and method
Patent #: 6069872
Issued on: 05/30/2000
Inventor: Bonomi, et al.

System for managing flow bandwidth utilization at network, transport and application layers in store and forward network
Patent #: 6285658
Issued on: 09/04/2001
Inventor: Packer

Use of a single data structure for label forwarding and imposition
Patent #: 6295296
Issued on: 09/25/2001
Inventor: Tappan

Distributed processing of high level protocols, in a network access server Patent #: 6304574
Issued on: 10/16/2001
Inventor: Schoo, et al.

Inventors

Application

No. 201337 filed on 11/30/1998

US Classes:

370/232Based on data flow rate measurement

Examiners

Primary: Yao, Kwang Bin
Assistant: Jones, Prenell

Attorney, Agent or Firm

Cesari and McKenna, LLP

International Class

G01R 031/08

Abstract

An interface (12, 14, or 16) in a service-provider network's transit label-switching router (P2) employs resource-management messages to inform neighbor routers of the bandwidths that it can allocate to various routes that it supports. To allocate its available bandwidth, it employs a weight value set for the route by an ingress router (PE2) in a system to which the label-switching router belongs. The transit router treats the weight as a relative bandwidth: when the sum of the bandwidths requested for various routes exceeds the bandwidth available, the router sets the bandwidths for at least some routes in accordance with the ratio of a given route's weight to the sum of the weights assigned to all routes among which it divides available bandwidth in this manner. That is, it assigns at least some bandwidth to all such routes, regardless of how small the resultant bandwidth may be. In this way, the network can operate with virtually no packet loss and yet remain available to all of its customers.