Queueing networks with multi-type messages of multiple classes: analysis and applications

• Autorzy: Matalycki M. , Koluzaewa K.
• Języki publikacji: EN

Abstrakty

EN

This paper provides the analysis and applications of networks with multi-type messages of multiple classes in systems. The network state is a vector, which components represent the number of messages in queues of the system. We obtained the sufficient conditions of representing the stationary distribution of the process, describing these networks, in the product form of factors characterizing separate systems.

Słowa kluczowe

EN

Markov queuing networks; state probabilities

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Informatyka Teoretyczna i Stosowana
• Rocznik: 2006
• Tom: R. 6, nr 10
• Strony: 19--26
• Opis fizyczny: Bibliogr. 5 poz.

Twórcy

autor

Matalycki M.

autor

Koluzaewa K.

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

Bibliografia

• [1] Vishnevsky V.M., Theory of computer system designing, Moscow 2003.
• [2] Filipovich B., Modelowanie i analiza sieci kolejkowych, Wydawnictwa AGH, Kraków 1997.
• [3] Bascett F., Chandy K.:VL, Munts R.R., Palasios F.G., Open, closed and mixed networks of queues with different classes of customers, Journal of ACM 1975, 22, 1248-260.
• [4] Matalytski M., Astahov A., Gomanchuk S., The multiplicativity of stationary distribution of Marcovian queuing networks in a case when probabilities of transitions depend on there states, Informatyka Teoretyczna i Stosowana 2002, 2, 3. 11-21.
• [5] Matalytski M., Queuing networks in stationary and transient regimes, GrSU, Grodno 2001.