Approximate analysis of load-dependent generally distributed queuing networks with low service time variability

European Journal of Operational Research

Volumn 205, Issue 2, 2010, Pages 381-389

  Ekren, Banu Yetkin ^a   Heragu, Sunderesh S ^b  

^a PAMUKKALE UNIVERSITY   (Turkey)

^b University of Louisville   (United States)

Author keywords

Conditional throughput; Load dependent network; Performance analysis; Queuing networks

Indexed keywords

APPROXIMATE ANALYSIS; APPROXIMATE METHODS; CLOSED QUEUING NETWORK; DISTRIBUTED QUEUING; ITERATIVE PROCEDURES; NETWORK PERFORMANCE ANALYSIS; PERFORMANCE ANALYSIS; QUEUING NETWORK; SERVICE TIME; SERVICE TIME DISTRIBUTION; SIMULATION RESULT;

APPROXIMATION THEORY; QUEUEING NETWORKS; THROUGHPUT;

QUEUEING THEORY;

EID: 76949097887     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.01.022     Document Type: Article

References (36)

1. Akyildiz I.F. Mean value analysis of closed queueing networks with Erlang service time distributions. Computing Journal 39 (1987) 219-232
2. Akyildiz I.F., and Sieber A. Approximate analysis of load dependent general queueing networks. IEEE Transactions on Software Engineering 14 (1988) 1537-1545
3. Baskett F., Chandy K.M., Muntz R.R., and Palacios-Gomez F. Open, closed and mixed networks of queues with different classes of customers. Journal of the ACM 22 (1975) 248-260
4. Bolch G., Greiner S., de Meer H., Kishor S., and Trivedi. Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications (1988), John Wiley & Sons, New York
5. Bryant R.M., Krzesinski A.E., Lakshmi M.S., and Chandy K.M. The MVA priority approximation. ACM Transactions on Computer Systems 2 (1984) 335-359
6. Buzen J.P. Computational algorithms for closed queueing networks with exponential servers. Communications of the ACM 16 (1973) 527-531
7. Casale, G., Mi, N., Smirni, E., 2008. Bound analysis of closed queuing networks with workload burstiness. In: Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 13-24.
8. Chandy K.M., Herzog U., and Woo L. Parametric analysis of queueing network models. IBM Journal of Research and Development 19 (1975) 36-42
9. Chandy K.M., and Martin J. A characterization of product form queueing networks. Journal of the ACM 30 (1983) 286-299
10. Gelenbe E., and Pujolle G. Introduction to Queueing Networks (1987), John Wiley & Sons Inc., New York
11. Gelenbe E. On approximate computer system models. Journal of the ACM 2 (1975) 261-269
12. Gordon W.J., and Newell G.F. Closed queueing networks with exponential servers. Operations Research 15 (1967) 252-267
13. Herzog U., Woo L., and Chandy K. Solution of queueing problems by a recursive technique. IBM Journal of Research and Development 19 (1975) 295-300
14. Horváth, A., Horváth, G., Telek, M., 2008. A joint moments based analysis of networks of MAP/MAP/1 queues. In: QEST Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp. 125-134.
15. Jackson J.R. Jobshop-like queueing systems. Management Science 10 (1963) 131-142
16. Jingdong Y., and San-qi L. Folding algorithm: A computational method for finite QBD processes with level-dependent transitions. IEEE Transactions on Communications 42 (1994) 625-539
17. Kobayashi H. Application of the diffusion approximation to queueing networks Part I: Equilibrium queue distributions. Journal of the ACM 2 (1974) 316-328
18. Kobayashi H. Application of the diffusion approximation to queueing networks Part II: Nonequilibrium distributions and computer modeling. Journal of the ACM 21 (1974) 456-469
19. Kouvatsos, D.D., 1985. Maximum entropy methods for general queueing networks. In: Proceeding of International Conference on Modelling Techniques and Tools for Performance Analysis, pp. 589-608.
20. Krzesinski A., and Greyling J. Improved lineariser methods for queuing networks. ACM Sigmetrics Performance Evaluation Review 12 (1984) 41-51
21. Kühn P.J. Approximate analysis of general queueing networks by decomposition. IEEE Transactions on Communications 27 (1979) 113-126
22. Marie, R., Snyder, P.M., Stewart, W.J., 1982. Extensions and computational aspects of an iterative method. In: Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, vol. 11, pp. 186-195.
23. Marie R. An approximate analytical method for general queueing networks. IEEE Transactions on Software Engineering SE-5 (1979) 530-538
24. k 1 / N queues ACM Sigmetrics. Performance Evaluation Review 9 (1980) 117-125
25. Maritsas D.G., and Xirokostas D.A. The M//r machine interference model. European Journal of Operational Research 1 (1977) 112-123
26. Noetzel A.S. A generalized queueing discipline for product form network solutions. Journal of the ACM 26 (1979) 779-793
27. Reiser M. A queuing network analysis of computer communication networks with flow control. IEEE Transactions on Communications COM-27 (1979) 1199-1209
28. Reiser M., and Lavenberg S.S. Mean value analysis of closed queueing networks. Journal of the ACM 2 (1980) 313-323
29. Reiser M. Mean value analysis and convolution method for queueing dependent servers in closed queueing networks. Performance Evaluation 1 (1981) 7-18
30. Sauer C.H. Computational algorithms for state dependent queueing networks. ACM Transactions on Computer Systems 1 (1983) 67-92
31. Shum, A., Buzen, J., 1977. The EPF Technique: A method for obtaining approximate solutions to closed queueing networks with general service times. In: Proceeding of 3rd Symposium on Measuring, Modeling and Evaluating Computer Systems, pp. 201-220.
32. Spirn J.P. Queuing networks with random selection for service. IEEE Transactions on Software Engineering SE-5 (1979) 287-289
33. Stewart W.J. A comparison of numerical techniques in Markov modeling. Communications of the ACM 21 (1978) 144-152
34. k / r / N queue. European Journal of Operational Research 5 (1980) 56-68
35. Whitt W. Performance of the queueing network analyzer. Bell System Technical Journal (1983) 62
36. Zahorjan, J., Lazowska, E.D., 1984. Incorporating load dependent servers in approximate mean value analysis. In: Proceedings of the ACM Sigmetrics Conference on Measurement and on Modeling of Computer Systems, pp. 52-62.