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
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the 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 in presence of bursty losses
Performance Evaluation - Special issue on internet performance modelling
Fixed point approximations for TCP behavior in an AQM network
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
Analysis of AIMD protocols over paths with variable delay
Computer Networks: The International Journal of Computer and Telecommunications Networking
Channel modeling and simulation in satellite mobile communication systems
IEEE Journal on Selected Areas in Communications
TCP/IP modeling and validation
IEEE Network: The Magazine of Global Internetworking
Distributed media-aware flow scheduling in cloud computing environment
Computer Communications
| Hi-index | 0.00 |
We analyze the performance of an Additive Increase Multiplicative Decrease (AIMD)-like flow control mechanism. The transmission rate is considered to increase linearly in time until the receipt of a congestion notification, when the transmission rate is multiplicatively decreased. AIMD captures the steady state behavior of TCP in the absence of timeouts and in the absence of maximum window size limitation. We introduce a general fluid model based on a multi-state Markov chain for the moments at which the congestion is detected. With this model, we are able to account for correlation and burstiness in congestion moments. Furthermore, we specify several simple versions of our general model and then we identify their parameters from real TCP traces.