Abstract
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.
Keywords
Network congestionComputer scienceComputer networkFlow control (data)BottleneckHop (telecommunications)Network packetNetwork traffic controlQuality of serviceReal-time computingEmbedded system
Affiliated Institutions
Related Publications
Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm
The congestion control algorithm embedded in the 4.3-Tahoe BSD TCP implementation has dramatically improved congestion control over the Internet. However, several recent simulat...
Supporting real-time applications in an Integrated Services Packet Network
This paper considers the support of real-time applications in an Integrated Services Packet Network (ISPN). We first review the characteristics of real-time applications. We obs...
The performance of adaptive window flow controls in a dynamic load environment
The behavior of window flow control schemes that adapt to changing network conditions is studied. A dynamic window scheme, which adjusts the window size based on explicit networ...
A binary feedback scheme for congestion avoidance in computer networks
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses a minimal amount of feedback from the network to t...
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
In heterogeneous networks, achieving congestion avoidance is difficult because the congestion feedback from one subnetwork may have no meaning to sources on other subnetworks. W...
Publication Info
- Year
- 1992
- Type
- article
- Pages
- 112-123
- Citations
- 147
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
147
OpenAlex
Cite This
Partho P. Mishra,
Hemant Kanakia
(1992).
A hop by hop rate-based congestion control scheme.
, 112-123.
https://doi.org/10.1145/144179.144254
Identifiers
- DOI
- 10.1145/144179.144254