|
Avtomatika i Telemekhanika, 2009, Issue 1, Pages 119–129
(Mi at12)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Queuing Systems
Probabilistic model of the algorithms of distributed control protocol in the internet network
O. Yu. Bogoyavlenskaya Petrozavodsk State University
Abstract:
Consideration was given to a queuing system that models interaction of two basic algorithms of the TCP protocol. Within the framework of analysis of this system, semi-Markov process of the unified data transmission rate was constructed, recurrent analytical representation of the stationary distribution of a Markov chain embedded in this process was determined, and stationary distribution of the original semi-Markov process was obtained. In view of high complexity of the analytical representation of the stationary distribution, an exact numerical linear-complexity algorithm was constructed enabling one to calculate some important characteristics of the initial protocol.
Citation:
O. Yu. Bogoyavlenskaya, “Probabilistic model of the algorithms of distributed control protocol in the internet network”, Avtomat. i Telemekh., 2009, no. 1, 119–129; Autom. Remote Control, 70:1 (2009), 107–117
Linking options:
https://www.mathnet.ru/eng/at12 https://www.mathnet.ru/eng/at/y2009/i1/p119
|
Statistics & downloads: |
Abstract page: | 261 | Full-text PDF : | 255 | References: | 56 | First page: | 4 |
|