Analysis of open queueing networks using method of generating functions

• Autorzy: Matalycki M. , Gomanczuk S. , Pankow A.
• Języki publikacji: EN

Abstrakty

EN

This paper provides the method of generating functions using for calculating the time-dependent state probabilities for open queuing networks in transient regime, when the network works in conditions of peak demand.

Słowa kluczowe

EN

generating functions; open queueing networks; Markov process

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Prace Naukowe Instytutu Matematyki i Informatyki Politechniki Częstochowskiej
• Rocznik: 2002
• Tom: Vol. 1, nr 1
• Strony: 143--152
• Opis fizyczny: Bibliogr. 13 poz., rys.

Twórcy

autor

Matalycki M.

• Institute of Mathematics and Computer Science, Technical University of Częstochowa

autor

Gomanczuk S.

• Institute of Mathematics and Computer Science, Technical University of Częstochowa

autor

Pankow A.

• Institute of Mathematics and Computer Science, Technical University of Częstochowa

Bibliografia

• [1] Matalytski M., Queuing networks at stationary and transient regime, Monografia, GrSU, Grodno 2001, 211.
• [2] Basharin G., Tolmatchev A., The theory of queuing networks and it’s applies for analyzing of computer systems and networks, The result of science and technics, T. 21, VINITI, Moscow 1983, 3-119.
• [3] Filipowicz B., Modelowanie i analiza sieci kolejkowych, AGH, Kraków 1997, 205.
• [4] Majewski K., Single class queuing networks with discrete and fluid customers on the time interval, Queuing Systems 2000, 36, 4, 405-435.
• [5] Harisson P., Transient behavior of queuing networks, Journal of Applied Probability 1981, 18, 2, 482-490.
• [6] Nykowska M., Model tandemowego systemu obsługi, Przegląd Statystyczny 1984, 29, 3, 531-540.
• [7] Massey W., Calculating exit times for series Jackson networks, Journal of Applied Probability 1987, 24, 1, 226-234.
• [8] Kobayashi H., Application of the diffusion approximation for queuing networks, Journal of ACM 1974, 21, 2-3, 316-328, 456-469.
• [9] Gelenbe E., Probabilistic models of computer systems, Diffusion approximation waiting times and batch arrivals, Acta Informatica 1979, 12, 285-303.
• [10] Czahorski T. , Modele kolejkowe systemów komputerowych, PŚ, Gliwice 1994, 184.
• [11] Matalytski, Finding probabilities of Markov queuing network states at transient regime, Automatic Control and Computer Science 1995, 28, 3, 9-12.
• [12] Matalycki., S. Gomanczuk, Analysis of stochastic models of computer systems and networks in transient behavior, Informatyka Teoretyczna i Stosowana 2002, 2, 9-20.
• [13] Tichonienko O., Teoria obsługi masowej, WSP, Częstochowa 2002, 150.