A binary feedback scheme for congestion avoidance in computer networks
ACM Transactions on Computer Systems (TOCS)
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
End-to-end Internet packet dynamics
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The ERICA switch algorithm for ABR traffic management in ATM networks
IEEE/ACM Transactions on Networking (TON)
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Variability in TCP round-trip times
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Deterministic packet marking for time-varying congestion price estimation
IEEE/ACM Transactions on Networking (TON)
A positive systems model of TCP-like congestion control: asymptotic results
IEEE/ACM Transactions on Networking (TON)
Delving into internet streaming media delivery: a quality and resource utilization perspective
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
The role of PASTA in network measurement
IEEE/ACM Transactions on Networking (TON)
MPCP: multi packet congestion-control protocol
ACM SIGCOMM Computer Communication Review
One bit is enough: a framework for deploying explicit feedback congestion control protocols
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
On the design of load factor based congestion control protocols for next-generation networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
IEEE Transactions on Multimedia
Automatica (Journal of IFAC)
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Many congestion control protocols use explicit feedback from the network to achieve high performance. Most of these either require more bits for feedback than are available in the IP header or incur performance limitations due to inaccurate congestion feedback. There has been recent interest in protocols that obtain high-resolution estimates of congestion by combining the explicit congestion notification (ECN) marks of multiple packets, and using this to guide multiplicative increase, additive increase, multiplicative decrease (MI-AI-MD) window adaptation. This paper studies the potential of such approaches, both analytically and by simulation. The evaluation focuses on a new protocol called Binary Marking Congestion Control (BMCC). It is shown that these schemes can quickly acquire unused capacity, quickly approach a fair rate distribution, and have relatively smooth sending rates, even on high bandwidth-delay product networks. This is achieved while maintaining low average queue length and negligible packet loss. Using extensive simulations, we show that BMCC outperforms XCP, VCP, MLCP, CUBIC, CTCP, SACK, and in some cases RCP, in terms of average flow completion times. Suggestions are also given for the incremental deployment of BMCC.