Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
1999-05-17
2003-05-27
Kizou, Hassan (Department: 2662)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S231000, C370S232000
Reexamination Certificate
active
06570854
ABSTRACT:
FIELD OF THE INVENTION
The invention relates generally to the field of digital communications systems and more particularly to digital networks for facilitating communication of digital data in, for example, digital image, audio and video distribution systems and among digital computer systems. The invention is more particularly directed to a digital network in which message transfer paths may be provided with various classes of transfer service, including an unregulated available bit rate service and provides a mechanism for allowing the network to control the rate at which devices transmit messages over the network based on congestion along the path between source devices and destination devices.
BACKGROUND OF THE INVENTION
Digital networks have been developed to facilitate the transfer of information, including data and programs, among digital computer systems and other digital devices. A variety of types of networks have been developed and implemented using diverse information transfer methodologies. In networks in which information is transferred using the well-known “ATM” (“Asynchronous Transfer Mode”) transfer methodology, communications are handled through a mesh of switching nodes. In an ATM network, the computer systems and other devices are connected to various ones of the switching nodes to, as information sources, provide information for transfer over the network and/or, as destinations, receive information from the network, with the information being transferred over paths, termed “virtual paths” and “virtual circuits,” established through switching nodes comprising the network. The virtual circuits through an ATM network can be assigned to various types of service classes, which serve to govern the rate at which information, in the form of “cells,” is transferred thereover. In some service classes, virtual circuits are guaranteed maximum rates at which information can be transferred thereover. Other service classes, on the other hand, provide “available bit rate” (“ABR”) services, for which virtual circuits are each guaranteed a minimum information transfer rate, referred to as a “minimum cell rate” (“MCR”) and can also make use of the bandwidth which has not been assigned to the virtual circuits which have the guaranteed maximum rates. For virtual circuits for which guaranteed maximum rates are provided, the sources already know the rates at which they can transmit information.
However, for virtual circuits which are associated with ABR service classes, the rate at which the sources can transmit may vary based on a number of factors, including, but not limited to, congestion conditions at the destination as well as congestion conditions at each switching node along the respective path from the source to the destination. To facilitate notifying each source of a virtual circuit which makes use of the ABR service class of the maximum rate at which it can transfer over the virtual circuit, the source periodically transmits a “resource management” (“RM”) cell over the virtual circuit, the RM cell including the MCR assigned to the virtual circuit. When the destination receives the RM cell, it transmits the RM cell back to the source in the reverse direction along the virtual circuit. The destination can include an explicit rate value in the backward RM cell which indicates the maximum rate at which the source can tmsmit information. Each switching node along the path can also determine the maximum rate at which it can allow the source to transmit information and, if that rate is lower than the explicit rate contained in the backward RM cell, it can substitute its rate as the explicit rate value in the backward RM cell. Thus, when the source receives the backward RM cell, the explicit rate contained therein will be the minimum value generated by the destination and all of the switching nodes along the path defined by the virtual circuit.
SUMMARY OF THE INVENTION
The invention provides a new and improved system and method, referred to herein as a virtual bandwidth explicit rate marking system, for performing explicit rate marking of resource management (RM) cells in an ATM network.
In brief summary, the invention provides an explicit rate marking system for use in connection with a switching node to generate an explicit rate value for use in a resource management cell associated with a virtual circuit in an ATM network. The explicit rate marking system comprises a virtual bandwidth value generator module and an explicit rate value generator module. The virtual bandwidth value generator module generate a virtual bandwidth value reflecting an available bandwidth capacity value, an explicit rate value associated with each bottlenecked virtual circuit for which the switching node forms part of a path, and a minimum cell rate value associated with each unbottlenecked virtual circuit for which the switching node forms part of a path. The explicit rate value generator module generates the explicit rate value in relation to the virtual bandwidth value and the minimum cell rate value associated with the virtual circuit and other virtual circuits for which the switching node forms part of a path.
REFERENCES:
patent: 5675576 (1997-10-01), Kalampoukas et al.
patent: 5701291 (1997-12-01), Roberts
patent: 5784358 (1998-07-01), Smith et al.
patent: 5946324 (1999-08-01), Mishra et al.
patent: 5966381 (1999-10-01), Buckley et al.
patent: 6052361 (2000-04-01), Ansari et al.
patent: 6178159 (2001-01-01), He et al.
patent: 6269078 (2001-07-01), Lakshman et al.
patent: 6324165 (2001-11-01), Fan et al.
patent: 6359863 (2002-03-01), Varma et al.
X. Zhang & J. Wu, “A Novel Explicit Rate Flow Control Mechanisim in ATM Networks”, IEEE Jan. 2001, p. 1576-1580.*
Lakshman, Mishra, and Ramakrishman, “Transporting Compressed Video Over ATM Networks with Explicit-Rate Feedback Control”, IEEE/ACM vol. 7, No. 5, Oct. 1999.*
K. Y. Kim, B. S. Kim, Y. B. Choi, S. T. Ko, and K.S. Kim, “Optimal Rate Based Flow Control for ABR Services in ATM Networks”, IEEE Jun. 1999, p. 773-776.*
B. Vandalore, R. Jain, R. Goyal, S. Fahmy, “Design and Analysis of Queue Control Functions for Explicit Rate Switch”, IEEE 03/98, p. 780-786.*
Y. T. Oh, S. H. Cho, and S. H. Park, “Adynamic Bandwidth Allocation Based on Transfer Rate Ratio for ABR Service in ATM Networks”, IEEE 1998, p. 471-474.*
A. Dinesh, and M. Moh, “An Efficient Traffic Control Scheme for Intergrated Voice, Video and Data over ATM Networks: Explicit Allowed Rate Algorithm”, IEEE 1997, p. 398-403.*
S. Chong, S. Lee, and S. Kang, “A Simple, Scalable, and Stable Explicit Rate Allocation Algroithm for MAX-MIN Flow Control with Minimum Rate Guarantee”, IEEE/ACM, vol. 9, No. 3, Jun. 2001, p. 322-335.*
O. Imer, T. Basar, and R. Srikant, “A Distributed Gobally Convergent Algorithm for Fair, Queue-Length-Base Congestion Control”, IEEE Sep. 2001, p. 622-627.*
Y. T. Hou, H. H. Y. Tzeng, S. S. Panwar, and V. P. Kumar, “Fair Network Bandwidth Allocation with Minimum Rate Guarantee and Its ABR Implemetations”, IEEE Aug. 1997, pp. 1411-1416.*
B. Melander, M. Bjorkman, and P. Gunningberg, “A New End-to-End Probing and Analysis Method for Estimating Bnadwidth Bottleneck”, IEEE Jan. 2000, p. 415-420.
Wang Ping
Yang Tao
Zhai Wengang
Ascend Communications, Inc.
Hoang Thai D
Kizou Hassan
LandOfFree
System and method for performing explicit rate marking for... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for performing explicit rate marking for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for performing explicit rate marking for... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3091086