Abstract
For tandem queueing networks with generally distributed service times, decomposition often is the only feasible solution method besides simulation. The network is partitioned into individual nodes which are analysed in isolation. In existing decomposition algorithms for continuous-time networks, the output of a queue is usually approximated as a renewal process, which serves as the arrival process to the next queue. In this paper, the internal traffic processes are described as semi-Markov processes (SMPs) and Markov modulated Poisson processes (MMPPs). Thus, correlations in the traffic streams, which are known to have a considerable impact on performance, are taken into account to some extent. A two-state MMPP, which arises frequently in communications modeling, serves as input to the first queue of the tandem network. For tandem networks with infinite or finite buffers, stationary mean queue lengths at arbitrary time computed quasi-promptly by the decomposition component of the tool TimeNET are compared to simulation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Baiocchi. Analysis of the loss probability of the MAP/G/1/K queue, Part I: Asymptotic theory. Comm. Statist.-Stochastic Models, 10(4):867–893, 1994.
D. R. Cox and V. Isham. Point Processes. Chapman and Hall, New York, 1980.
R. L. Disney and P. C. Kiessler. Traffic Processes in Queueing Networks: A Markov Renewal Approach. John Hopkins University Press, 1987.
W. Fischer and K. Meier-Hellstern. The Markov-modulated Poisson process (MMPP) cookbook. Perf. Eval., 18:149–171, 1992.
P. Franken, D. König, U. Arndt, and V. Schmidt. Queues and Point Processes. John Wiley and Sons, 1982.
F. N. Gouweleeuw. Calculating the loss probability in a BMAP/G/1/N+1 queue. Comm. Statist.-Stochastic Models, 12(3):473–492, 1996.
D. Gross and D.R. Miller. The randomization technique as a modeling tool and solution procedure for transient Markov processes. Oper. Res., 32:345–361, 1984.
G. Hasslinger. Discrete time queues with variable input: Workload based analysis and applications. In GI-Fachtagung: Messung, Modellierung und Bewertung von Rechen-und Kommunikationssystemen, pages 39–53, Freiberg, Germany, 1997.
H. Heffes and D. M. Lucantoni. A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. IEEE J. Select. Areas Comm., 4(6):856–868, 1986.
A. Heindl. Approximate analysis of queueing networks with finite buffers and losses by decomposition. Technical Report 1998-8, Computer Science Dept., TU Berlin, Berlin, Germany, 1998.
D. L. Jagerman. An inversion technique for the laplace transform. The Bell System Technical Journal, 61(8):1995–2002, 1982.
P. J. Kühn. Approximate analysis of general queueing networks by decomposition. IEEE Trans. Comm., COM-27:113–126, 1979.
D. M. Lucantoni. New results on the single server queue with a batch markovian arrival process. Commun. Statist.-Stochastic Models, 7(1):1–46, 1991.
D. R. Manfield and T. Downs. Decomposition of traffic in loss systems with renewal input. IEEE Trans. Comm., COM-27:44–58, 1979.
M. Neuts. Matrix-Geometric Solutions in Stochastic Models. John Hopkins University Press, 1981.
R. Sadre, B. Haverkort, and A. Ost. An efficient and accurate decomposition method for open finite and infinite buffer queueing networks. In Proc. 3rd Int. Workshop on Num. Solution of Markov Chains, pp. 1–20, Zaragoza, Spain, 1999.
S. N. Simonova. Output flow of single-line queueing systems. Ukrainskii Matematecheskii Zhurnal, 21:501–510, 1969.
S. S. Wang and J. A. Silvester. An approximate model for performance evaluation of real-time multimedia communication systems. Perf. Eval., 22:239–256, 1995.
W. Whitt. The queueing network analyzer. The Bell System Technical Journal, 62:2779–2815, 1983.
A. Zimmermann, J. Freiheit, R. German, and G. Hommel. Petri net modelling and performability evaluation with TimeNET 3.0. In Proc. 9th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, Chicago, USA, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heindl, A. (2000). Decomposition of General Tandem Queueing Networks with MMPP Input. In: Haverkort, B.R., Bohnenkamp, H.C., Smith, C.U. (eds) Computer Performance Evaluation.Modelling Techniques and Tools. TOOLS 2000. Lecture Notes in Computer Science, vol 1786. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46429-8_7
Download citation
DOI: https://doi.org/10.1007/3-540-46429-8_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67260-9
Online ISBN: 978-3-540-46429-7
eBook Packages: Springer Book Archive