Mean-value analysis methods for closed networks with multi-type messages

• Autorzy: Astachov A. , Matałycki M.
• Języki publikacji: EN

Abstrakty

EN

The paper provides the mean-value analysis methods to obtaining different average characteristics of the queueing networks in stationary regime. We consider queueing networks with multi-channel devices and multi-type messages. The intensity of servicing depends on message type and the type of the message can vary at transition between service de-vices.

Słowa kluczowe

EN

mean-value analysis; queueing networks; multi-type messages; internet portal

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

Twórcy

autor

Astachov A.

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

autor

Matałycki M.

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

Bibliografia

• [1] Krakowsky M., Conservation method in queueing theory, RAIRO 1973, 1,63-84.
• [2] Ramalthoto M., Amaral J., Cochito M., A survey of J. Littles formula, Intern. Statistic. Review 1983, 51, 255-278.
• [3] ReiserM., Lavenberg S., Mean value analysis of closed multichain queueing network, Journal of the ACM 1980, 27, 2, 313-322.
• [4 ] Matalytski M.A., Method for finding of the non steady-state distribution probabilities of queueing networks, Information Transfer Problems 1994, 2, 104-107 (in Russian).
• [5] ConwayA., Souza E., Lavenberg S., Mean value analysis by chain of product form queueing networks, IEEE Trans. Comput. 1989, 38, 3, 432-442.
• [6] Tucci S., MacNair E., Implementation of the mean-value analysis for open, closed and mixed networks, Comput. Perform. 1982, 3, 233-339.
• [7] Zahorjan J., Wong E., The solution of separable queueing network models using mean value analysis Perform. Eval. Rev. 1981, 10, 3, 80-85.
• [8] Kelly F.P., Reversibility and stochastic networks, Willey, New York 1979.
• [9] Towasik S., Remarks on the MVA priority approximation, Arch. Inf. Teor. i Stos. 1990, 2, 1, 6-75.
• [10] Porocki S.M., About correctness of using mean-value analysis methods using for queueing networks, Automation and Remote Contro1 1990, 12, 170-173 (in Russian).
• [11] Porocki S.M., Effectiveness of the extended mean value method, Automation and Remote Control 1993, 9, 124- 135 (in Russian).
• [12] Zahorjan J., Eager D., Sweillam H., Accuracy, speed and convergence of approximate mean value analysis, Perform. Eval. Rev. 1988, 8, 4, 225-270.
• [13] Matalytski M., Mean-value analysis methods for network with multi line servers, Automatic Control and Computer Sciences 1994, 28, 2, 19-24.
• [14] Matalytski M.A., Recurrent mean-value analysis method with respect to the moments of time, Automation and Remote Control 2000,60, 11, 1, 1552-1557.
• [15] Astahov A., Mean-value analysis methods for some kind of multi-type queueing networks, Queues: flows, systems, networks, Vol. 16, BSU, Minsk 2001, 24-29.
• [16] Matalytski M., Queueing networks in stationary and transient regime, GrSU, Grodno 2001 (in Russian).
• [17] A. Gokikashvilli V., Vishnevskij V., Queueing networks, The theory and using for computer networks, Radio and Communication, Moscow 1988 (in Russian).