A Transient Discrete-Time Queueing Analysis of the ATM Multiplexer

In this paper, we present a transient discrete-time queueing analysis of the ATM multiplexer whose arrival process consists of the superposition of the traffic generated by independent binary Markov sources. The functional equation describing the ATM multiplexer has been transformed into a mathematically tractable form. This allows derivation of the transient probability generating functions of the queue length and the number of active sources in the system. Then, application of the final value theorem results in the corresponding steady-state probability generating functions, as well as packet delay. We also present closed form expressions for the transient and steady-state moments of the queue length. The pure transform approach used in the present analysis is an extension of the well-known classical method used in the transient analysis of single server queues with uncorrelated arrivals. As a result, the analysis is relatively easy to follow and gives an alternative solution of the ATM multiplexer that does not involve matrix operations. The matrix solutions usually assume that the probability generating matrix of the system has distinct eigenvalues, where the solution presented here does not have such restrictions. The paper presents significant new simple results on the transient analysis of the ATM multiplexer.

[1]  San-Qi Li,et al.  Transient analysis of multi-server queues with Markov-modulated Poisson arrivals and overload control , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[2]  Herwig Bruneel.  Queueing behavior of statistical multiplexers with correlated inputs , 1988, IEEE Trans. Commun..

[3]  Hiroshi Saito,et al.  Teletraffic Technologies in ATM Networks , 1994 .

[4]  P. Henrici.  Power series, integration, conformal mapping, location of zeros , 1974 .

[5]  San-qi Li,et al.  Transient Analysis of Multi-Server Queues with Markov-Modulated Poisson Arrivals and Overload Control , 1992, Perform. Evaluation.

[6]  Ji Zhang,et al.  Spectral Decomposition Approach for Transient Analysis of Multi-Server Discrete-Time Queues , 1994, Perform. Evaluation.

[7]  D. Owen,et al.  Handbook of statistical distributions , 1978 .

[8]  G. F. Newell,et al.  Introduction to the Theory of Queues. , 1963 .

[9]  Herwig Bruneel,et al.  A general relationship between buffer occupancy and delay in discrete-time multiserver queueing models, applicable in ATM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[10]  Y. Lee,et al.  Discrete time queues with phase dependent arrivals , 1994, IEEE Trans. Commun..

[11]  Audrey M. Viterbi,et al.  Approximate Analysis of Time-Synchronous Packet Networks , 1986, IEEE J. Sel. Areas Commun..

[12]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .

[13]  G. F. Newell,et al.  Introduction to the Theory of Queues. , 1963 .

[14]  B. Conolly.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .

[15]  Sidney L. Hantler,et al.  An Analysis of a Class of Telecommunications Models , 1994, Perform. Evaluation.

[16]  Herwig Bruneel,et al.  Exact Derivation of Transient Behavior for Buffers with random Output Interruptions , 1991, Comput. Networks ISDN Syst..

[17]  Ward Whitt,et al.  Computing transient distributions in general single-server queues , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[18]  T. Suda,et al.  Evaluation of an admission control scheme for an ATM network considering fluctuations in cell loss rate , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[19]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

[20]  Amedeo R. Odoni,et al.  An Empirical Investigation of the Transient Behavior of Stationary Queueing Systems , 1983, Oper. Res..

[21]  Marcel F. Neuts.  The single server queue with Poisson input and semi-Markov service times , 1966 .

[22]  B. Palka.  An Introduction to Complex Function Theory , 1995 .

[23]  Edmund Taylor Whittaker,et al.  A Course of Modern Analysis , 2021 .

[24]  San-Qi Li,et al.  Study of information loss in packet voice systems , 1989, IEEE Trans. Commun..