Abstract
A unified approach is applied to analyze the departure processes of finite/infinite BMAP/G/1 queueing systems for both vacationless and vacation arrangements via characterizing the moments, the z-transform of the scaled autocovariance function of interdeparture times C P (z), and lag n (n≥1) covariance of interdeparture times. From a structural point of view, knowing departure process helps one to understand the impact of service mechanisms on arrivals. Through numerical experiments, we investigate and discuss how the departure statistics are affected by service and vacation distributions as well as the system capacity. From a practical perspective, output process analysis serves to bridge the nodal performance and connectionwise performance. Our results can be then used to facilitate connection- or networkwise performance analysis in the current high-speed networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
ATM Forum, ATM User–Interface Specification, Version 3.0 (Prentice–Hall, Englewood Cliffs, NJ, 1993).
D. Bertsekas and R. Gallager, Data Networks, 2nd ed. (Prentice–Hall, Englewood Cliffs, NJ, 1987).
P.J. Burke, The output of a queueing system, Oper. Res. 4 (1956) 699–704.
D.J. Daley, Queueing output processes, Adv. in Appl. Probab. 8 (1976) 395–415.
B.T. Doshi, Queueing systems with vacations — a survey, Queueing Systems 1 (1986) 29–66.
H.W. Ferng and J.F. Chang, The departure process of discrete–time queueing systems with Markovian type inputs, Queueing Systems 36 (2000) 201–220.
W. Fischer and K.S. Meier–Hellstern, The Markov–modulated Poisson process (MMPP) cookbook, Performance Evaluation 18 (1993) 149–171.
W.K. Grassmann, M.I. Taksar and D.P. Heyman, Regenerative analysis and steady state distribution for Markov chains, Oper. Res. 33 (1985) 1107–1116.
P. Harrison and N. Pated, Performance Modeling of Communication Networks and Computer Architectures (Addison–Wesley, New York, 1993).
D.P. Heyman and M.J. Sobel, Handbooks in Operations Research and Management Science, Vol. 2, Stochastic Models (Elsevier, Amsterdam, 1990), chapter V.
P.G. Hoel, S.C. Port and C.J. Stone, Introduction to Probability Theory (Houghton Mifflin, Boston, 1971).
L. Kleinrock, Queueing Systems, Vol. I: Theory (Wiley, New York, 1975).
P.J. Kuehn, Remainder on queueing theory for ATM networks, Telecommunication Systems 5 (1996) 1–24.
A.M. Law and W.D. Kelton, Simulation Modeling and Analysis, 2nd ed. (McGraw–Hill, New York, 1991).
D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Commun. Statist. Stochastic Models 7(1) (1991) 1–46.
D.M. Lucantoni, K.S. Meier–Hellstern and M.F. Neuts, A single–server queue with server vacations and a class of non–renewal arrival processes, Adv. in Appl. Probab. 22 (1990) 676–705.
D.E. McDysan and D.L. Spohn, ATM Theory and Application (McGraw–Hill, New York, 1995).
M.F. Neuts, A versatile Markovian point process, J. Appl. Probab. 16 (1979) 746–779.
M.F. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Applications (Marcel Dekker, New York, 1989).
H. Saito, The departure process of an N/G/1 queue, Performance Evaluation 11 (1990) 241–251.
L. Takács, Introduction to the Theory of Queues (Oxford Univ. Press, Oxford, 1962).
P.C. Yeh, Departure process and queueing analyses for several classes of single server queueing systems, Master thesis, Department of Elect. Engineering, National Taiwan University, Taipei, Taiwan (1998), chapter 3.
P.C. Yeh and J.F. Chang, Characterizing the departure process of a single server queue from the embedded Markov renewal process at departures, Queueing Systems 35 (2000) 381–395.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ferng, HW., Chang, JF. Departure Processes of BMAP/G/1 Queues. Queueing Systems 39, 109–135 (2001). https://doi.org/10.1023/A:1012786932415
Issue Date:
DOI: https://doi.org/10.1023/A:1012786932415