Decomposition of general queueing networks with MMPP inputs and customer losses

Performance Evaluation

Volumn 51, Issue 2-4, 2003, Pages 117-136

  Heindl, Armin ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximate analysis; Data loss queueing networks; Decomposition based on SMPs and MMPPs; MMPP inputs; Traffic processes

Indexed keywords

MARKOV PROCESSES; MATHEMATICAL MODELS; TELECOMMUNICATION SYSTEMS; TELECOMMUNICATION TRAFFIC;

SERVICE CENTERS;

QUEUEING NETWORKS;

EID: 0037297050     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(02)00091-3     Document Type: Conference Paper

References (29)

1. i/Ph/1 queue Oper. Res. 42:1994;158-174.
2. Blondia C., The N/G/1 finite capacity queue. Commun. Statist.-Stochastic Models. 5(2):1989;273-294.
3. Çinlar E., Decomposition of a semi-Markov process under a Markovian rule. Aust. J. Statist. 8(3):1966;163-170.
4. R. Chakka, O. Gemikonakli, P.G. Harrison, Approaches to modelling open networks with bursty arrivals, in: Proceedings of the Eighth IFIP Workshop on Performance Modelling and Evaluation of ATM & IP Networks, Networks UK, Ilkley, UK, 2000, pp. 13/1-17.
5. D.R. Cox, V. Isham, Point Processes, Chapman & Hall, New York, 1980.
6. Fischer W., Meier-Hellstern K., The Markov-modulated Poisson process (MMPP) cookbook. Perform. Eval. 18:1992;149-171.
7. Gouweleeuw F.N., Calculating the loss probability in a BMAP/G/1/N + 1 queue Commun. Statist.-Stochastic Models. 12(3):1996;473-492.
8. D. Green, Lag correlations of approximating departure processes of MAP/PH/1 queues, in: Proceedings of the Third International Conference on Matrix-Analytic Methods in Stochastic Models, Leuven Belgium, 2000, pp. 135-151.
9. Hasslinger G., Waiting time, busy periods and output models of a server analyzed via Wiener-Hopf factorization. Perform. Eval. 40:2000;3-26.
10. B.R. Haverkort, Approximate analysis of networks of PH/PH/1/ K queues: theory & tool support, in: H. Beilner, F. Bause (Eds.), Quantitative Evaluation of Computing and Communication Systems, Lecture Notes in Computer Science, Vol. 977, Springer, Berlin, 1995, pp. 239-253.
11. Heffes H., Lucantoni D.M., A Markov-modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. IEEE J. Select. Areas Commun. 4(6):1986;856-868.
12. A. Heindl, Approximate analysis of queueing networks with finite buffers and losses by decomposition, Technical Report 1998-8, Fachbereich Informatik, TU Berlin, 1998.
13. Heindl A., Decomposition of general tandem queueing networks with MMPP input. Perform. Eval. 44:2001;5-23.
14. Kouvatsos D.D., Entropy maximisation and queueing network models. Ann. Oper. Res. 48:1994;63-126. (special issue on queueing networks).
15. Kühn P.J., Approximate analysis of general queueing networks by decomposition. IEEE Trans. Commun. COM-27:1979;113-126.
16. Livny M., Melamed B., Tsiolis A.K., The impact of autocorrelation on queueing systems. Manage. Sci. 39:1993;322-339.
17. Lucantoni D.M., New results on the single server queue with a batch Markovian arrival process. Commun. Statist.-Stochastic Models. 7(1):1991;1-46.
18. Manfield D.R., Downs T., Decomposition of traffic in loss systems with renewal input. IEEE Trans. Commun. COM-27:1979;44-58.
19. Meier K.S., A fitting algorithm for Markov-modulated Poisson processes having two arrival rates. Eur. J. Oper. Res. 29:1987;370-377.
20. K. Mitchell, A. van de Liefvoort, Approximation models of feed-forward G/G/1/N queueing networks with correlated arrivals, Perform. Eval. 51 (2003) 137-152.
21. M. Neuts, Algorithmic Probability: A Collection of Problems, Chapman & Hall, New York, 1995.
22. Perros H.G., Park D., Yamashita H., Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss. Oper. Res. Lett. 15:1994;95-104.
23. R. Sadre, B. Haverkort, A. Ost, An efficient and accurate decomposition method for open finite and infinite buffer queueing networks, in: Proceedings of the Third International Workshop on Numerical Solution of Markov Chains, Zaragoza, Spain, 1999, pp. 1-20.
24. Shi L., Approximate analysis for queueing networks with finite-capacity and customer loss. Eur. J. Oper. Res. 85:1995;178-191.
25. Simonova S.N., Output flow of single-line queueing systems. Ukrainskii Matematecheskii Zhurnal. 21:1969;501-510.
26. Wang S.S., Silvester J.A., An approximate model for performance evaluation of real-time multimedia communication systems. Perform. Eval. 22:1995;239-256.
27. Whitt W., Performance of the queueing network analyzer. Bell Syst. Tech. J. 62:1983;2817-2843.
28. Whitt W., The queueing network analyzer. Bell Syst. Tech. J. 62:1983;2779-2815.
29. A. Zimmermann, J. Freiheit, R. German, G. Hommel, Petri net modelling and performability evaluation with TimeNET 3.0, in: Proceedings of the 11th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, Chicago, USA, 2000, pp. 188-202.