Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Analysis of Dynamic Congestion Control Protocols — A Fokker–Planck Approximation

Analysis of Dynamic Congestion Control Protocols — A Fokker–Planck Approximation We present an approximate analysis of a queue with a dynamically changing input rate that is based on implicit or explicit feedback information. This is motivated by proposals for adaptive congestion control algorithms, (6) and (15), where the sender's window size at the transport level is adjusted based on perceived congestion level of a bottleneck node. We develop an analysis methodology for a simplified system; however, it is powerful enough to answer important questions regarding stability, convergence (or oscillations), fairness and the significant effect that delayed feedback plays on performance. This paper quantitatively identifies the cause of the these effects, vis-a-vis the system parameters and properties of the algorithm used. Several conservation laws and balance equations governing this system are given. The model is fairly general and can be applied to evaluate the performance of a wide range of feedback control schemes. It is an extension of the classical Fokker-Planck equation. Because the Fokker-Planck equation models diffusion, it addresses traffic variability, and in a sense, extends earlier fluid approximation analyses. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of High Speed Networks IOS Press

Analysis of Dynamic Congestion Control Protocols — A Fokker–Planck Approximation

Loading next page...
 
/lp/ios-press/analysis-of-dynamic-congestion-control-protocols-a-fokker-planck-mK4gNIR7v5

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
IOS Press
Copyright
Copyright © 1994 by IOS Press, Inc
ISSN
0926-6801
eISSN
1875-8940
DOI
10.3233/JHS-1994-3102
Publisher site
See Article on Publisher Site

Abstract

We present an approximate analysis of a queue with a dynamically changing input rate that is based on implicit or explicit feedback information. This is motivated by proposals for adaptive congestion control algorithms, (6) and (15), where the sender's window size at the transport level is adjusted based on perceived congestion level of a bottleneck node. We develop an analysis methodology for a simplified system; however, it is powerful enough to answer important questions regarding stability, convergence (or oscillations), fairness and the significant effect that delayed feedback plays on performance. This paper quantitatively identifies the cause of the these effects, vis-a-vis the system parameters and properties of the algorithm used. Several conservation laws and balance equations governing this system are given. The model is fairly general and can be applied to evaluate the performance of a wide range of feedback control schemes. It is an extension of the classical Fokker-Planck equation. Because the Fokker-Planck equation models diffusion, it addresses traffic variability, and in a sense, extends earlier fluid approximation analyses.

Journal

Journal of High Speed NetworksIOS Press

Published: Jan 1, 1994

There are no references for this article.