A survey of straightforward statistical multiplexing models for ATM networks

Connection Acceptance Control (CAC) is probably the most important function in the preventive congestion control strategy to be implemented in ATM networks. The CAC function must decide, on the basis of the traffic descriptors provided by an incoming connection, whether the new call can be accepted or not. A key factor in the access decision is the behaviour of the superposition of ATM VCs in a switch output buffer, and in particular the cell loss probability resulting from accepting the connection. Many models have been proposed in the literature in order to investigate this issue. In this paper, we present a survey of the queuing models used to estimate the cell loss probability in ATM networks with straightforward statistical multiplexing. The CAC policy under consideration is based on the so-called Worst Case Traffic allocation corresponding to the traffic descriptor parameters submitted by a VC: itspeak cell rate, cell delay variation tolerance, sustainable cell rate, andintrinsic burst tolerance parameters, when applicable. We plan to investigate the practical application of these models to the problem of CAC; in particular, the important issues of accuracy of the available models, their range of validity and their complexity deserve more attention than they have received up to now. The present survey stands as a first step in that direction.

[1]  J.W. Roberts,et al.  Variable-bit-rate traffic control in B-ISDN , 1991, IEEE Communications Magazine.

[2]  Catherine Rosenberg,et al.  On characterizing an ATM source via the sustainable cell rate traffic descriptor , 1995, Proceedings of INFOCOM'95.

[3]  J. Virtamo,et al.  Transient and stationary distributions for fluid queues and input processes with a density , 1991 .

[4]  Roch Guérin,et al.  Analysis of a statistical multiplexer with generalized periodic sources , 1994, Queueing Syst. Theory Appl..

[5]  Jorma T. Virtamo,et al.  The superposition of periodic cell arrival streams in an ATM multiplexer , 1991, IEEE Trans. Commun..

[6]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[7]  Catherine Rosenberg,et al.  Dimensioning a Traffic Control Device in an ATM Network , 1994, Broadband Communications.

[8]  Jacky Guibert,et al.  Large Deviations Approximations for Fluid Queues Fed by a Large Number of On/Off Sources , 1995, IEEE J. Sel. Areas Commun..

[9]  T. R. Griffiths Analysis of a connection acceptance strategy for asynchronous transfer mode networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[10]  Bharat T. Doshi,et al.  Deterministic rule based traffic descriptors for broadband ISDN: worst case behavior and connection acceptance control , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[11]  Jorge García-Vidal,et al.  A Discrete Time Queueing Model to Study the Cell Delay Variation in an ATM Network , 1994, Perform. Evaluation.

[12]  Jorma T. Virtamo,et al.  The Superposition of Variable Bit Rate Sources in an ATM Multiplexer , 1991, IEEE J. Sel. Areas Commun..

[13]  J.-P. Coudreuse,et al.  Spacing cells protects and enhances utilization of ATM network links , 1992, IEEE Network.

[14]  Brahim Bensaou,et al.  A Traffic Control Framework for High Speed Data Transmission , 1993, Modelling and Evaluation of ATM Networks.

[15]  Hans Kröner,et al.  Performance Modelling of an Adaptive CAC Strategy for ATM Networks , 1994 .

[16]  Jacky Guibert,et al.  Overflow probability upper bound for heterogeneous fluid queues handling general on-off sources , 1994 .

[17]  Gopalakrishnan Ramamurthy,et al.  Distributed Source Control: A Network Access Control for Integrated Broadband Packet Networks , 1991, IEEE J. Sel. Areas Commun..

[18]  K. Kvols,et al.  Bounds and approximations for the periodic on/off queue with applications to ATM traffic control , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[19]  James W. Roberts Rate Envelope Multiplexing and Rate Sharing in B-ISDN , 1995 .

[20]  Henry J. Fowler,et al.  Local Area Network Traffic Characteristics, with Implications for Broadband Network Congestion Management , 1991, IEEE J. Sel. Areas Commun..

[21]  Zbigniew Dziong,et al.  Adaptive traffic admission in ATM networks - optimal estimation framework* , 1994 .

[22]  Joseph Y. Hui Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[23]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[24]  J. Sole-Pareta,et al.  Bandwidth allocation based on real time calculations using the convolution approach , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[25]  Jorma Virtamo,et al.  Evaluating buffer requirements in an ATM multiplexer , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.