Loss probability approximation of a statistical multiplexer and its application to call admission control in high-speed networks

This paper studies the cell loss probability approximation of a statistical multiplexer in high speed networks. For this purpose, we consider discrete-time finite-buffer queueing models. We first propose a simple approximate formula for the cell loss probability in terms of the tail distribution of the queue length in the corresponding infinite-buffer queue. Since the tail distribution has a simple asymptotic expression in many situations, we revisit the asymptotic analysis of the tail distribution. Furthermore we consider specific source traffic models which are particularly important in practice. The formula allows heterogeneous sources and each source is characterized only by a small number of parameters so that they meet engineering requirements. Combining those results, we propose a new call admission control (CAC) scheme which is based on the the cell loss probability as a measure of quality of services.

[1]  Frank N. Gouweleeuw.  The Loss Probability in Finite-Buffer Queues with Batch Arrivals and Complete Rejection , 1994 .

[2]  Tetsuya Takine,et al.  An analysis of a discrete-time queue for broadband ISDN with priorities among traffic classes , 1994, IEEE Trans. Commun..

[3]  Khosrow Sohraby,et al.  On the asymptotic behavior of heterogeneous statistical multiplexer with applications , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[4]  Ward Whitt,et al.  Tail probabilities with statistical multiplexing and effective bandwidths in multi-class queues , 1993, Telecommun. Syst..

[5]  Henk Tijms,et al.  Heuristics for Finite-Buffer Queues , 1992, Probability in the Engineering and Informational Sciences.

[6]  Tatsuya Suda,et al.  Cell loss and output process analyses of a finite-buffer discrete-time ATM queueing system with correlated arrivals , 1995, IEEE Trans. Commun..

[7]  W. Whitt,et al.  Asymptotics for steady-state tail probabilities in structured markov queueing models , 1994 .

[8]  Egbert Falkenberg,et al.  On the asymptotic behaviour of the stationary distribution of Markov chains of M/G/1-type , 1994 .

[9]  Alexander Graham,et al.  Kronecker Products and Matrix Calculus: With Applications , 1981 .

[10]  Genji Yamazaki,et al.  Evaluating the Overflow Probability Using the Infinite Queue , 1993 .

[11]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[12]  Masakiyo Miyazawa,et al.  Comparison of two approximations for the loss probability in finite-buffer queues , 1993 .

[13]  Chris Blondia,et al.  Statistical Multiplexing of VBR Sources: A Matrix-Analytic Approach , 1992, Perform. Evaluation.

[14]  Tetsuya Takine,et al.  Cell loss and output process analyses of a finite-buffer discrete-time ATM queueing system with correlated arrivals , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.