|
Informatika i Ee Primeneniya [Informatics and its Applications], 2009, Volume 3, Issue 4, Pages 22–29
(Mi ia76)
|
|
|
|
Calculation algorithm of workload of telecommunication network with repetitive transmissions
Ya. M. Agalarov Institute for Problems of Informatics RAS
Abstract:
The models of packet switching network with repetitive transmissions for two schemes of buffer memory distributions — complete sharing and complete partitioning — are considered. The iterative method of calculation of stream intensity in network and probabilities of node blocking where node model is the queueing system of type $\begin{matrix} M \\ \vec{\lambda} \end{matrix} \bigg| \begin{matrix} M \\ \vec{\lambda} \end{matrix} \bigg| \vec{m} | N$ is proposed. The necessary condition for existence of solution of stream balance conservation equations in steady-state regime was established. The monotone convergence of stream intensities sequence and probabilities of blocking derived in the proposed method to the solution of these combined equations was proved.
Keywords:
network of packets switching; buffer memory; repetitive transmissions; probabilities of blocking; iteration method.
Citation:
Ya. M. Agalarov, “Calculation algorithm of workload of telecommunication network with repetitive transmissions”, Inform. Primen., 3:4 (2009), 22–29
Linking options:
https://www.mathnet.ru/eng/ia76 https://www.mathnet.ru/eng/ia/v3/i4/p22
|
Statistics & downloads: |
Abstract page: | 249 | Full-text PDF : | 93 | References: | 42 | First page: | 1 |
|