Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A connectionless congestion control algorithm
ACM SIGCOMM Computer Communication Review
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
The next generation of internetworking
ACM SIGCOMM Computer Communication Review
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Loss-load curves: support for rate-based congestion control in high-speed datagram networks
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Characteristics of wide-area TCP/IP conversations
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Traffic phase effects in packet-switched gateways
ACM SIGCOMM Computer Communication Review
Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed
ACM SIGCOMM Computer Communication Review
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
A hop by hop rate-based congestion control scheme
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
On hop-by-hop rate-based congestion control
IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
A novel high speed transport protocol based on explicit virtual load feedback
Computer Networks: The International Journal of Computer and Telecommunications Networking
Communications of the ACM
Queue - Networks
Catch the whole lot in an action: rapid precise packet loss notification in data centers
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.02 |
Gateways in very high speed internets will need to have low processing requirements and rapid responses to congestion. This has prompted a study of the performance of the Random Drop algorithm for congestion recovery. It was measured in experiments involving local and long distance traffic using multiple gateways. For the most part, Random Drop did not improve the congestion recovery behavior of the gateways A surprising result was that its performance was worse in a topology with a single gateway bottleneck than in those with multiple bottlenecks. The experiments also showed that local traffic is affected by events at distant gateways.