Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm
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
Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP
ACM SIGCOMM Computer Communication Review
An integrated congestion management architecture for Internet hosts
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
pTCP: An End-to-End Transport Layer Protocol for Striped Connections
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
The End-to-End Performance Effects of Parallel TCP Sockets on a Lossy Wide-Area Network
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
End-to-end rate-based congestion control: convergence properties and scalability analysis
IEEE/ACM Transactions on Networking (TON)
ElasticSwitch: practical work-conserving bandwidth guarantees for cloud computing
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
| Hi-index | 0.00 |
We investigate schemes for achieving service differentiation via weighted end-to-end congestion control mechanisms within the framework of the additive-increase-multiplicative-decrease (AIMD) principle, and study their performance as instantiations of the TCP protocol.Our first approach considers a class of weighted AIMD algorithms. This approach does not scale well in practice because it leads to excessive loss for flows with large weights, thereby causing early timeouts and a reduction in throughput.Our second approach considers a class of loss adaptive weighted AIMD algorithms. This approach scales by an order of magnitude compared to the previous approach, but is more susceptible to short-term unfairness and is sensitive to the accuracy of loss estimates.We conclude that adapting the congestion control parameters to the loss characteristics is critical to scalable service differentiation; on the other hand, estimating loss characteristics using purely end-to-end mechanisms is an inherently difficult problem.