State probabilities of computer network models with dependent on time arrival and service parameters

• Autorzy: Matałycki M. , Koluzaewa K.
• Języki publikacji: EN

Abstrakty

EN

In this article the method of multidimensional generating functions is observed. It can be applied for finding state probabilities of stochastic queueing models of computer and telecommunication networks (ICTN) of arbitrary topology, which functioning under condition of heavy loading. Investigations were carried out in transitional (nonsteady state); open Markovian queueing networks (QN) with dependent on time arrival process and service parameters are used as models. Expressions for state probabilities were obtained as multidimensional functional series.

Słowa kluczowe

EN

queueing model; computer and telecommunication networks; state probabilities

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Informatyka Teoretyczna i Stosowana
• Rocznik: 2008
• Tom: R. 8, nr 14
• Strony: 7--18
• Opis fizyczny: Bibliogr. 5 poz., rys.

Twórcy

autor

Matałycki M.

autor

Koluzaewa K.

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

Bibliografia

• [1J Milikov A., Teletraffic. Models, methods, optimization, Kiev 2007 (in Russian).
• [2] Vishnevsky V., Theory of computer network design. Moscow 2003 (in Russian).
• [3] Bianchi G., Performance Analisys of the IEEE 802.11 Distributed Coordination Function, IEEE Journal of Selected Areas in Comunication 2000, 18, 535-548.
• |4] Cali F., Conti M., Gregory E., Dinamic Tuning of the IEEE 802.11 Protocol to Achieve a Theoretical Throughput Limit, IEEE/ACM Transactions on Networking 2000, 8, 785-799.
• [5] Matalytski M., Gomanchuk S., Pankov A., Analysis of open queueing networks using method of generating functions. Scientific Research of the Institute of Mathematics and Computer Science Czestochowa University of Technology 2002, 1. 1, 143-152.