Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
1999-09-28
2004-02-24
Chin, Wellington (Department: 2664)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S395210
Reexamination Certificate
active
06697369
ABSTRACT:
RELATED APPLICATIONS
The present invention is related to the following concurrently filed applications: Model-Based Admission Control Adjustment in Data Networks, by Z. Dziong; Learning-Based Admission Control Adjustment in Data Networks, by Z. Dziong and M. Ji. Each of these concurrently filed applications is assigned to the assignee of the present invention, and each is hereby incorporated by reference into the present application.
FIELD OF THE INVENTION
The present invention relates to high-speed data networks, such as Asynchronous Transfer Mode (ATM) networks. More particularly, the present invention relates to Admission Control for bandwidth management and congestion control in such networks.
Still more particularly, the present invention relates to the use of Connection Admission Control (CAC) adjustments in ATM networks using network measurement data to further control and tune an analytical CAC system.
BACKGROUND OF THE INVENTION
In broadband integrated services networks, e.g., those using asynchronous transfer mode (ATM) systems and techniques, information is packetized in fixed length “cells” for statistical multiplexing with other traffic for transmission over high-bit-rate channels. Such networks are connection oriented, so a connection must be established before transmission begins. Moreover, these connections are usually subject to contracts between a network operator and users of the network. To ensure quality of service (QoS) consistent with these contracts, connection admission control (CAC) techniques are typically employed in management of such networks. Generally, CAC algorithms determine whether a new virtual channel connection should be admitted to the network based on network status—such as available resources, cell loss performance—and contract parameters (e.g., mean traffic rate and peak traffic rate). See generally, Dziong, Z., ATM
Network Resource Management
, McGraw-Hill, 1997.
Because of the complex variety of connection types and services, and consequent difficulty in ascertaining complete and current information regarding the actual state of ATM networks, and because of possible adverse consequences of failing to honor QoS guarantees in customer contracts, many network operators have chosen to use CAC algorithms that are quite conservative. Most CAC algorithms are designed for worst-case source behavior. Moreover, analytical models applied in these algorithms are also conservative—to account for the difficulty in achieving exact modeling of the connection aggregate process. Such conservative approaches in many cases tend to offset statistical multiplexing gains and other system efficiencies available in ATM networks.
Some have proposed using actual network measurements (such as traffic level and cell-loss characteristics in light of corresponding QoS constraints) to adjust CAC mechanisms in an attempt to more fully use network resources. See, for example, Bensaou, B.; Lam, S. T. C.; Chu, H. and Tsang, D. H. K., “Estimation of the Cell Loss Ratio in ATM Networks with a Fuzzy System and Application to Measurement-Based Call Admission Control,”
IEEE/ACM Transactions on Networking
, VOL. 5, NO. 4 (August 1997), pp. 572-584; Gibbens, R. J., Kelly, F. P., and Key, P. B., “A decision-theoretic approach to call admission control in ATM networks,”
IEEE Journal on Selected Areas in Communication
, 13(6):1101-1114 (1995); and Saito, H. “Dynamic call admission control in ATM networks,
IEEE Journal on selected Areas in Communication
, 9(7):982-989 (1991).
Thus far however, attempts to use network operating measurements have proven difficult in network administration, especially in respect of their incorporation in CAC processes. A particular difficulty arises in some prior art CAC processes in efficiently treating operations in networks exhibiting a wide variety of traffic types with a concomitant variety of QoS constraints. High bandwidth efficiencies through CAC tuning have not been readily available without high precision measurements.
SUMMARY OF THE INVENTION
The present invention overcomes limitations of prior art CAC algorithms and achieves a technical advance, as described in connection with illustrative embodiments presented below.
In accordance with one aspect of the present invention, the concept of aggregate effective bandwidth, AEBW, is used to provide a useful approximation to required bandwidth for given levels and classes of network traffic. AEBW is used in deriving an allowed level of overbooking—expressed in terms of an overbooking gain, &agr;
t
.
In accordance with another aspect of the present invention, an estimate is made of the probability distribution function for a maximum equivalent bandwidth, typically in the context of a network operations system, to provide information to switches to control over-booking gain. This over-booking gain is derived from a count of cells arriving in periodic time slots and is updated from time to time based on measurement values sent from individual switches to the operations system. Time slots duration for the counts is illustratively chosen in accordance with buffer length at ports of the switches.
In illustrative operation, a maximum of counts determined during a representative 15-minute interval and is sent to the operations system. Only the maximum count need be sent. From the individual measurements, the operations system estimates the probability distribution function by histograms of the measured values.
The presently disclosed embodiments provide tools that can be used for tuning call/traffic admission control and for network bandwidth management and dimensioning purposes. While the proposed methods and systems are described in the context of ATM network links, embodiments of the present invention are applicable to any packet-switched network.
REFERENCES:
patent: 5315586 (1994-05-01), Charvillat
patent: 5357507 (1994-10-01), Hughes et al.
patent: 5463620 (1995-10-01), Sriram
patent: 5499238 (1996-03-01), Shon
patent: 5570360 (1996-10-01), Klausmeier et al.
patent: 5838681 (1998-11-01), Bonomi et al.
patent: 5862126 (1999-01-01), Shah et al.
patent: 5872771 (1999-02-01), Park et al.
patent: 5878029 (1999-03-01), Hasegawa et al.
patent: 5881049 (1999-03-01), Beshai et al.
patent: 5917804 (1999-06-01), Shah et al.
patent: 5953338 (1999-09-01), Ma et al.
patent: 6215768 (2001-04-01), Kim
Dziong Zbigniew Marek
Lau Wlng Cheong
Chin Wellington
Pham Brenda
LandOfFree
Admission control adjustment in data networks using maximum... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Admission control adjustment in data networks using maximum..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Admission control adjustment in data networks using maximum... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3326257