Investigation of probabilistic model of computer network with central servicing system in transient behavior

• Autorzy: Malatycki M. , 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 networks in transient time.

Słowa kluczowe

EN

computer network; open queueing network; generating function

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Informatyka Teoretyczna i Stosowana
• Rocznik: 2003
• Tom: R. 3, nr 4
• Strony: 7--18
• Opis fizyczny: Bibliogr. 23 poz., 2 rys.

Twórcy

autor

Malatycki M.

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

autor

Pankow A.

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

Bibliografia

• [1] Basharin G., Bocharov P., Kogan Ya., Analysis of queues in computer networks, Nauka, Moscow (in Russian).
• [2] Basharin G., Tolmatchev A., The theory of QN and it's applies for analyzing CSN, The results of science and techniques, V. 21, VINITI, Moscow 1983, 3-119 (in Russian).
• [3] Gogikashvili V., Wishnevskij V., Queuing networks, The theory and using for computer networks, Radio and Communication, Moscow 1988 (in Russian).
• [4] Aven O., Gurin N., Kogan Ya., Evaluation of quality and optimization of computer systems, Nauka, Moscow 1982 (in Russian).
• [5] Kleinrok L., Computer systems with queues, Mir, Moscow 1979 (in Russian).
• [6] Signaevski V., Kogan Ya., Methods of computer systems speed estimation, Nauka, Moscow 1991 (in Russian).
• [7] Anisimov V., Lebedev E., Stochastic queueing networks, Markov models, Lybidz, Kiev 1992 (in Russian).
• [8] Yashkov S., Queueing analysis for computers, Radio i sviaz, Moscow 1989 (in Russian).
• [9] Matalytski M., Queueing networks at stationary and transient regimes, GrSU, Grodno 2001 (in Russian).
• [10] Filipowicz B., Modelowanie i analiza sieci kolejkowych, AGH, Kraków 1997.
• [11] Czahorski T., Modele kolejkowe systemów komputerowych, PS, Gliwice 1994.
• [12] Majewski K., Single class queuing networks with discrete and fluid customers on the time interval, Queuing Systems 2000, 36, 4, 405-435.
• [13] Harrison P., Transient behavior of queuing networks, Journal of Applied Probability 1981, 18, 2, 482-490.
• [14] Nykowska M., Model tandemowego systemu obsługi, Przegląd Statystyczny 1984, 29, 3, 531-540.
• [15] Massey W., Calculating exit times for series Jackson networks, Journal of Applied Probability 1987, 24, 1, 226-234.
• [16] Kobayashi M., Application of the diffusion approximation for queueing networks, Journal of ACM 1974, 21, 2, 3, 316-328, 456-469.
• [17] Gelenbe E., Probabilistic models of computer systems, Diffusion approximation wating times and batch arrivals, Acta Informatica 1979, 12, 285-303.
• [18] Medvedev G., Closed queueing systems and their optimization, Informations AN USSR, Technical Cybernetics 1978, 6, 199-203 (in Russian).
• [19] Matalytski M., Gomanczuk S., Analysis of stochastic models of computer systems and networks in transient behavior, Informatyka Teoretyczna i Stosowana/Computer Science 2002, 2(2), 9-20.
• [20] Bazarov V., Transient probabilities for queueing systems with absolute priority, Computer algorithms of applied mathematics, Samarkand 1987, 49-52 (in Russian).
• [21] Matalytski M., Gomanczuk S., Pankov A., Analysis of the open queueing networks using method of generating functions, Prace Naukowe Instytutu Matematyki i Informatyki Politechniki Częstochowskiej 2002, l (1), 143-153.
• [22] Matveev N., Methods of integration for differential equations, Vyzshaja shkola, Moscow 1987 (in Russian).
• [23] Samojlenko A., Kryvosheja S., Perestiuk N., Differential equations. Examples and tasks, Vyzshaja shkola, Moscow 1987 (in Russian).