Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A stochastic model of TCP/IP with stationary random losses
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
TCP/IP performance over 3G wireless links with rate and delay variation
Proceedings of the 8th annual international conference on Mobile computing and networking
On the long-run behavior of equation-based rate control
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling the AIADD paradigm in networks with variable delays
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
| Hi-index | 0.00 |
The throughput of AIMD protocols in general and of TCP in particular, has been computed in many existing works by modeling the round-trip time as a constant and thus replacing it by its expectation. There are however many scenarios in which the delays of packets vary, causing a variation of the round-trip time. Many typical scenarios occur in wireless and mobile networks. We propose in this paper an analytical model that accounts for the variability of delay, while computing the throughput of an AIMD protocol. We derive a closed-form expression for the throughput, that illustrates the impact of delay variability. We show by analysis and simulation, that an increase in the variability of delay improves the performance of an AIMD protocol. Thus, an analytical model that only considers the average delay could underestimate the performance of an AIMD protocol in scenarios where delay is variable.