SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
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
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
ACM SIGCOMM Computer Communication Review
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm
ACM SIGCOMM Computer Communication Review
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Phantom: a simple and effective flow control scheme
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
The ERICA switch algorithm for ABR traffic management in ATM networks
IEEE/ACM Transactions on Networking (TON)
ACM SIGCOMM Computer Communication Review
Source rate encoding mechanisms for binary congestion control
Performance Evaluation
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Delay-based congestion avoidance for TCP
IEEE/ACM Transactions on Networking (TON)
Is the round-trip time correlated with the number of packets in flight?
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Accumulation-based congestion control
IEEE/ACM Transactions on Networking (TON)
Performance of TCP congestion control with explicit rate feedback
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Adaptive congestion protocol: A congestion control protocol with learning capability
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network buffer requirements of the rate-based control mechanism for ABR services
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Adaptive algorithms for feedback-based flow control in high-speed, wide-area ATM networks
IEEE Journal on Selected Areas in Communications
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.24 |
It has been recognized that router-assisted congestion control based on explicit-rate feedback exhibits better performance than the implicit feedback mechanisms currently available on the Internet. However, the deployment of explicit-rate algorithms in the Internet poses some challenges, in particular, the requirement of multi-byte congestion notifications per packet. In this paper, we present a new mechanism for congestion control signaling, based on probabilistic marking of 1-bit feedback channels. The scheme is suitable for router algorithms that were originally devised for multi-byte explicit-rate marking. The proposed mechanism, which includes a source algorithm and a router marking procedure, removes the deployment constraints concerning multi-byte feedback while keeping the essential characteristics and performance of the router algorithms. We show, through simulation, that the performance of router-assisted control of sources subject to the proposed binary feedback is close to the performance obtained with sources subject to explicit-rate feedback.