Abstract
The authors suggest and investigate a general input congestion control scheme that takes into account a broad spectrum of network issues. As a preventive congestion control strategy, a leaky-bucket-type scheme operating on a session basis that limits the session's average rate and the burstiness is proposed. This restrictive control is combined with an optimistic bandwidth usage scheme which works by marking packets into two different colors, green and red. The packets are marked so that the average green packet rate entering the network is at the reserved average rate. The average red packet rate represents traffic in excess of this guaranteed average rate and is sent to further utilize unused bandwidth in the network. Both types of packets are further filtered by a spacer which limits the peak rate at which the packets enter the network. The marked packets are then sent into the network, where they are treated according to their color, using at each intermediate node a simple threshold policy.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
BurstinessNetwork packetComputer networkComputer scienceNetwork traffic controlNetwork congestionBandwidth (computing)Real-time computingSession (web analytics)
Affiliated Institutions
Related Publications
Random early detection gateways for congestion avoidance
The authors present random early detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average...
Dynamic adaptive windows for high speed data networks with multiple paths and propagation delays
The optimal design of windows for virtual circuits has been studied for high-speed, wide-area data networks in an asymptotic framework in which the delay-bandwidth product is th...
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...
Congestion avoidance in computer networks with a connectionless network layer: concepts, goals and methodology
The authors compare the concept of congestion with that of flow control and congestion control. A number of possible alternatives for congestion avoidance are identified. From t...
Distributed code assignments for CDMA packet radio networks
Code-division multi-access (CDMA) techniques allow many users to transmit simultaneously in the same band without substantial interference by using approximately orthogonal (low...
Publication Info
- Year
- 2002
- Type
- article
- Pages
- 520-526
- Citations
- 167
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
167
OpenAlex
Cite This
Kavita Bala,
Israel Cidon,
K. Sohraby
(2002).
Congestion control for high speed packet switched networks.
, 520-526.
https://doi.org/10.1109/infcom.1990.91290
Identifiers
- DOI
- 10.1109/infcom.1990.91290