CAVT: a congestion avoidance visualization tool
ACM SIGCOMM Computer Communication Review
Uncooperative congestion control
Proceedings of the joint international conference on Measurement and modeling of computer systems
Fine-grained layered multicast with STAIR
IEEE/ACM Transactions on Networking (TON)
Effectiveness and issues of congestion control in 802.11g wireless LANs
Wireless Networks
| Hi-index | 0.00 |
This work presents a comprehensive theoretical framework for window-based congestion control protocols that are designed to converge to fairness and efficiency. We first derive a sufficient condition for convergence to fairness. Using this, we show how fair window increase/decrease policies can be constructed from suitable pairs of monotonically non-decreasing functions. We show that well-studied protocols such as TCP, GAIMD and Binomial congestion control can be constructed using this method. Thus we provide a common framework for the analysis of such window-based protocols. To validate our approach, we present experimental results for a new TCP-friendly protocol, LOG, designed using this framework with the objective of reconciling the smoothness requirement of streaming media-like applications with the need for a fast dynamic response to congestion.