Queueing systems and networks. Models and applications

• Autorzy: Filipowicz B. , Kwiecień J.
• Języki publikacji: EN

Abstrakty

EN

This article describes queueing systems and queueing networks which are successfully used for performance analysis of different systems such as computer, communications, transportation networks and manufacturing. It incorporates classical Markovian systems with exponential service times and a Poisson arrival process, and queueing systems with individual service. Oscillating queueing systems and queueing systems with Cox and Weibull service time distribution as examples of non-Markovian systems are studied. Jackson’s, Kelly’s and BCMP networks are also briefly characterized. The model of Fork-Join systems applied to parallel processing analysis and the FES approximation making possible of Fork-Join analysis is also presented. Various types of blocking representing the systems with limited resources are briefly described. In addition, examples of queueing theory applications are given. The application of closed BCMP networks in the health care area and performance evaluation of the information system is presented. In recent years the application of queueing systems and queueing networks to modelling of human performance arouses researchers’ interest. Hence, in this paper an architecture called the Queueing Network-Model Human Processor is presented.

Słowa kluczowe

EN

queueing systems; queueing networks; performance analysis

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 2008
• Tom: Vol. 56, nr 4
• Strony: 379--390
• Opis fizyczny: Bibliogr. 29 poz., rys.

Twórcy

autor

Filipowicz B.

autor

Kwiecień J.

• Department of Automatics, AGH University of Science and Technology, 30 Mickiewicza Ave., 30-059 Kraków, Poland

Bibliografia

• [1] S. Stidham, “Analysis, design and control of queueing systems”, Operations Research 50 (1), 197–216 (2002).
• [2] G. Bolch, S. Greiner, H. de Meer, and K.S. Trivedi, Queueing Networks and Markov Chains. Modelling and Performance Evaluation with Computer Science Applications, John Wiley&Sons, Inc., London, 1998.
• [3] T. Czachórski, Queueing Models in Performance Evaluation of Computer Networks and Systems, Jacek Skalmierski’s Computer Workshop, Gliwice, 1999, (in Polish).
• [4] B. Filipowicz, Stochastic Models in Operation Research: Analysis and Synthesis of the Queueing Systems and Networks, WNT, Warszawa, 1996, (in Polish).
• [5] B. Filipowicz, Modelling and Optimization of Queueing Systems. Volume 1, Markovian systems, Kraków, 1999, (in Polish).
• [6] L. Kleinrock, Queueing Systems, Volume 1, Theory, John Wiley & Sons, New York, 1975.
• [7] K. Idzikowska, “Structural optimization of M/Mm/FIFO/m+N queueing system with individual service and flux of arrivals”, ZN AGH Electrotechnics and Electronics 19 (1), 38-44 (2000), (in Polish).
• [8] B. Filipowicz, Modelling and Optimization of Queueing Systems. Volume 2, Non-Markovian systems, Kraków, 2000, (in Polish).
• [9] A. Rutkowska, The Models of Queueing Systems and Networks with Weibull Servers, Ph.D. dissertation, AGH-UST, Kraków, 2001, (in Polish).
• [10] W.Weibull, “A statistical distribution function of wide applicability”, J. Appl. Mech. 18, 293–297 (1951).
• [11] H.C. Tijms, Stochastic Modelling and Analysis: A computational approach, John Wiley & Sons, London, 1986.
• [12] H.C. Tijms, Stochastic Models, An Algorithmic Approach, John Wiley & Sons, London, 1994.
• [13] A. Chydzinski, “The M/G-G/1 oscillating queueing system”, Queueing Systems 42 (3), 255-268 (2002).
• [14] A. Chydzinski, “The M-M/G/1-type oscillating systems”, Cybernetics and Systems Analysis 39 (2), 316-324 (2003).
• [15] B. Filipowicz, Modelling and analysis of queueing networks, Wydawnictwa AGH, Kraków, 1997, (in Polish).
• [16] F. Baskett, K. Chandy K, R. Muntz, and F. Palacios, “Open, closed and mixed networks of queues with different classes of customers”, J. ACM 22 (2), 248-260 (1975).
• [17] J.P. Buzen, “Computational algorithms for closed queueing networks with exponential servers”, Communications of the ACM 16 (9), 527–531 (1973).
• [18] M. Reiser and S. Lavenberg, “Mean value analysis of closed multichain queueing networks”, J. ACM 27 (2), 313–322 (1980).
• [19] D. Neuse and K. Chandy, “SCAT: a heuristic algorithm for queueing network models of computing system”, ACM Sigmetrics Performance Evaluation Review 10 (1), 59–79 (1981).
• [20] A. Duda and T. Czachórski, “Performance evaluation of Fork and Join synchronization Primitives”, Acta Informatica 24 (5), 525–553 (1987).
• [21] B. Filipowicz and J. Kwiecien, “Fork-join systems”, ZN AGH Automatics 7 (3), 707–716 (2003), (in Polish).
• [22] H.G. Perros, Queueing Networks with Blocking: Exact and Approximate Solutions, Oxford University Press, New York, 1994.
• [23] S. Balsamo, V. de Nito Persone, and R. Onvural, Analysis of Queueing Networks with Blocking, Kluwer Academic Publishers, Boston, 2001.
• [24] J. Kwiecien, The Application of Queueing Networks with Multiple Job Classes in Organizational Problems of Health Service, Ph.D. dissertation, AGH-UST, Kraków, 2004, (in Polish).
• [25] A. Zgrzywa, Queueing Methods in Performance Evaluation of the Information Systems, Oficyna Wydawnicza Politechniki Wrocławskiej, Wrocław, 1998, (in Polish).
• [26] Y. Liu, “Queueing network modelling of elementary mental processes”, Psychological Review 103 (1), 116–136 (1996).
• [27] O. Tsimhoni and Y. Liu, “Steering a driving simulator using the queueing network-model human processor (QNMHP)”, Proc. 2nd Int. Symposium on Human Factors in Driver Assessment, Training and Vehicle Design, 81–85 (2003).
• [28] C. Wu and Y. Liu, “Modelling human transcription typing with queueing network-model human processor (QN-MHP)”, Proc. 47th Annual Meeting of Human Factors and Ergonomics Society 5, 381–385 (2004).
• [29] C. Wu and Y. Liu, “Modelling psychological refractory period (PRP) and practice effect on PRP with queueing networks and reinforcement learning algorithms”, Proc. 6th Int. Conf. on Cognitive Modelling, 320–325 (2004).