Abstract
In this paper, we study a single-server queue with finite capacity in which several space priority mechanisms are implemented. The arrival process is the general Markovian arrival process (MAP) which has been used to model the bursty arrival processes commonly arising in communication applications. The service times are generally distributed. These buffer mechanisms enable the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the quality of service requirements of the specific broadband ISDN services and to improve the utilization of the network resources. This is done by a selective discarding of cells according to the class they belong to. Computable expressions for various performance parameters are obtained. Numerical results are given for the case of a two-state Markov-modulated Poisson process (MMPP) and deterministic service times. The values derived can be used to evaluate the benefits of using priorities in an ATM network when the traffic is bursty and to make a comparative study of the buffer mechanisms. These results extend the models previously developed, which were limited to Poisson arrivals.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Bellman,Introduction to Matrix Analysis (McGraw-Hill, 1970).
C. Blondia, TheN/G/1 finite capacity queue, Stochastic Models 5(1989)273–294.
C. Blondia, Finite capacity vacation models with non-renewal input, J. Appl. Prob. 28(1991)174–197.
CCITT Draft Recommendation I.361: ATM layer specification for B-ISDN, Study Group XVIII, Geneva (January, 1990).
E. Çinlar,Introduction to Stochastic Processes (Prentice-Hall, Englewood Cliffs, NJ, 1975).
J.N. Daigle and J.D. Langford, Queueing analysis of a packet voice communication system,IEEE Infocom '85 (1985), pp. 18–26.
J. García and O. Casals, Priorities in ATM networks, NATO Adv. Res. Workshop (June 1990).
G. Hebuterne and A. Gravey, A space priority queueing mechanism for multiplexing ATM channels,ITC Specialist Seminar, Adelaide (Sept. 1989), Paper 7.4
H. Heffes and D.M. Lucantoni, A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance, IEEE J. Sel. Areas Commun. SAC-4(1986).
M. Kawarazaki, H. Saito and H. Yamada, An analysis of statistical multiplexing in an ATM transport network,ICC '90.
H. Kroner, Comparative performance study of space priority mechanisms for ATM channels,IEEE Infocom '90, San Francisco (June 1990).
D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stochastic Models 7 (1991).
D.M. Lucantoni, K. Meier-Hellstern and M.F. Neuts, A single server queue with server vacations and a class on non-renewal arrival processes, Adv. Appl. Prob. 22(1990)676–705.
D.M. Lucantoni and V. Ramaswami, Efficient algorithms for solving the nonlinear matrix equations arising in phase types queues, Stochastic Models 1(1985)29–51.
M.F. Neuts, A versatile Markovian point process, J. Appl. Prob. 16(1979)764–779.
R. Nagarajan, J.F. Kurose and D. Towsley, Approximation techniques for computing packet loss in finite-buffered voice multiplexer,Infocom '90 (1990), pp. 947–955.
L.K. Platzman, J.C. Ammons and J.J. Bartholdi, III, A simple algorithm to compute tail probabilities from transforms, Oper. Res. 36(1988).
S. Sumita and T. Ozawa, Achievability of performance objectives in ATM switching nodes,Proc. Int. Seminar on Performance of Distributed and Parallel Systems, Kyoto, Japan (Dec. 1988), pp. 45–56.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
García, J., Casals, O. Stochastic models of space priority mechanisms with Markovian arrival processes. Ann Oper Res 35, 269–296 (1992). https://doi.org/10.1007/BF02024994
Issue Date:
DOI: https://doi.org/10.1007/BF02024994