Data networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Sirpent: a high-performance internetworking approach
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Random drop congestion control
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Dynamic adaptive windows for high speed data networks: theory and simulations
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A control-theoretic approach to flow control
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
Analysis of a rate-based control strategy with delayed feedback
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Interaction among virtual circuits using predictive congestion control
Computer Networks and ISDN Systems - Special issue on high speed networks
Some observations on the dynamics of a congestion control algorithm
ACM SIGCOMM Computer Communication Review
An adaptive congestion control scheme for real-time packet video transport
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Optimizing file transfer response time using the loss-load curve congestion control mechanism
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
End-to-end packet delay and loss behavior in the internet
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Feedback control of congestion in packet switching networks: the case of a single congested node
IEEE/ACM Transactions on Networking (TON)
ACM SIGCOMM Computer Communication Review
An adaptive congestion control scheme for real time packet video transport
IEEE/ACM Transactions on Networking (TON)
On hop-by-hop rate-based congestion control
IEEE/ACM Transactions on Networking (TON)
Time scale analysis scalability issues for explicit rate allocation in ATM networks
IEEE/ACM Transactions on Networking (TON)
Dynamic bandwidth allocation using loss-load curves
IEEE/ACM Transactions on Networking (TON)
Queue management for explicit rate based congestion control
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Time-shift scheduling—fair scheduling of flows in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Transporting compressed video over ATM networks with explicit-rate feedback control
IEEE/ACM Transactions on Networking (TON)
A Robust Heuristic for Minimizing Cell Loss in ATM Networks
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
A Novel RED-Based Hop-by-Hop Congestion Control
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
End-to-end rate-based congestion control: convergence properties and scalability analysis
IEEE/ACM Transactions on Networking (TON)
Markov-chain modeling for multicast signaling delay analysis
IEEE/ACM Transactions on Networking (TON)
Mitigating congestion in wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Distributed Flow Control and Medium Access in Multihop Ad Hoc Networks
IEEE Transactions on Mobile Computing
A simple and efficient hop-by-hop congestion control protocol for wireless mesh networks
WICON '06 Proceedings of the 2nd annual international workshop on Wireless internet
Hop-by-hop congestion control over a wireless multi-hop network
IEEE/ACM Transactions on Networking (TON)
IP is dead, long live IP for wireless sensor networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
HxH: a hop-by-hop transport protocol for multi-hop wireless networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Block-switched networks: a new paradigm for wireless transport
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
A reactive and dependable transport protocol for wireless mesh networks
Journal of Parallel and Distributed Computing
Time scale analysis of explicit rate allocation in ATM networks
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
Robust non-probabilistic bounds for delay and throughput in credit-based flow control
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
| Hi-index | 0.00 |
The flow/congestion control scheme of TCP is based on the sliding window mechanism. As we demonstrate in this paper, the performance of this and other similar end-to-end flow control schemes deteriorates as networks move to the gigabit range. This has been the motivation for our search for a new flow and congestion control scheme. In this paper, we propose as an alternative, a hop-by-hop rate-based mechanism for congestion control. Due to the increasing sophistication in switch architectures, to provide “quality of service” guarantees for real-time as well as bursty data traffic, the implementation of hop-by-hop controls has become relatively inexpensive. A cost-effective implementation of the proposed scheme for a multi-gigabit packet switch is described in [2]. In this paper, we present results of a simulation study comparing the performance of this hop-by-hop flow control scheme to two end-to-end flow control schemes. The results indicate that the proposed scheme displays stable behavior for a wide range of traffic conditions and diverse network topologies. More importantly, the performance of the scheme, measured in terms of the average number of occupied buffers, the end-to-end throughput, the network delay, and the link utilization at the bottleneck, is better than that of the end-to-end control schemes studied here. These results present a convincing case against popular myths about hop-by-hop control mechanisms.