Abstract

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 network congestion indicators, is proposed. The throughput performance of the adaptive policy under both steady-state and nonstationary conditions is studied. The superiority of this scheme over some previously proposed adaptive window schemes based on implicit congestion detection is demonstrated.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

Window (computing)Computer scienceThroughputNetwork congestionSliding window protocolScheme (mathematics)Real-time computingFlow (mathematics)Control theory (sociology)Computer networkArtificial intelligenceControl (management)MathematicsTelecommunicationsOperating system

Affiliated Institutions

Related Publications

Publication Info

Year
2002
Type
article
Pages
55-62
Citations
14
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

14
OpenAlex

Cite This

Sridhar Pingali, David Tipper, J.L. Hammond (2002). The performance of adaptive window flow controls in a dynamic load environment. , 55-62. https://doi.org/10.1109/infcom.1990.91233

Identifiers

DOI
10.1109/infcom.1990.91233