Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Introduction to queueing theory (2nd ed)
Introduction to queueing theory (2nd ed)
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
TCP is max-plus linear and what it tells us on its throughput
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
An integrated model for the latency and steady-state throughput of TCP connections
Performance Evaluation
A mean-field model for multiple TCP connections through a buffer implementing RED
Performance Evaluation
Analysis of the Random Flow Generated by the Feedback Transport Protocol in a Data Transfer Network
Automation and Remote Control
A stochastic model of TCP/IP with stationary random losses
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.