The multiplicativity of stationary distribution of markovian queueing networks in a case when probabilities of transitions depend on their states

• Autorzy: Matalytsky M. , Astahov A. , Gomanchuk S.
• Języki publikacji: EN

Abstrakty

EN

This paper provides the analysis of the above-mentioned networks with multi-type messages and systems with multiple queues. There the network stale is a vector, which components represent the number of messages in queues of the systems. We obtained the sufficient conditions of representing the stationary distribution of the process, describing this networks, in the product of factors characterizing separate systems.

Słowa kluczowe

EN

computer systems and networks; queueing networks; stale probabilities

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Informatyka Teoretyczna i Stosowana
• Rocznik: 2002
• Tom: R. 2, nr 3
• Strony: 11--21
• Opis fizyczny: Bibliogr. 10 poz.

Twórcy

autor

Matalytsky M.

• Institute of Mathematics and Computer Science, Technical University of Częstochowa Dąbrowskiego 73, 42-200 Częstochowa

autor

Astahov A.

• Institute of Mathematics and Computer Science, Technical University of Częstochowa Dąbrowskiego 73, 42-200 Częstochowa

autor

Gomanchuk S.

• Institute of Mathematics and Computer Science, Technical University of Częstochowa Dąbrowskiego 73, 42-200 Częstochowa

Bibliografia

• [1] Geogicashwilly V.A., Vishnevsky V.M., Queuing networks. The theory and application for PC networks, Radio and Communications, Moscow 1998.
• [2] Czakorski T., Modele kolejkowe systemów komputerowych, Politechnika Śląska, Gliwice 1994.
• [3] Filipowicz B., Modelowanie i analiza sieci kolejkowych, Wydawnictwa AGH, Kraków 1997.
• [4] Jackson J.R., Networks of waiting lines, Operational Research 1957, 5, 4, 131-142.
• [5] Gordon W.J., Newell G.F., Closed queuing systems with exponential servers, Operational Research 1967, 15, 2, 254-265.
• [6] Baskett F., Chandy K.M., Munts R.R., Palasios F.G., Open, closed and mixed networks of queues with different classes of customers, Journal of ACM 1975, 22, 2, 248-260.
• [7] Matalytsky M., Queuing networks in stationary and transient regimes, GrSU, Grodno 2001.
• [8] Matalytski M., Gomanchuk S., Analysis of stochastic models of computer systems and networks in transient behavior, Informatyka Teoretyczna i Stosowana 2002, 2, 2, 9-20.
• [9] Astahov A., Matalytski M., Mean-value analysis methods for closed networks with multi-type messages, Informatyka Teoretyczna i Stosowana 2002, 2, 2, 21-34.
• [10] Foster F.G., On stochastic matrices associated with certa in queuing process, Annual Math. Statist. 1953, 24, 2, 254-265.