Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
6-2001
Abstract
The paper analyzes how using a longer memory of the past queue occupancy in computing the average queue occupancy affects the stability and variability of a RED queue. Extensive simulation studies with both persistent and Web TCP sources are used to study the variance of the RED queue as a function of the memory of the averaging process. Our results show that there is very little performance improvement (and in fact, possibly significant performance degradation) if the length of memory is increased beyond a very small value. Contrary to current practice, our results show that a longer memory reduces the negative correlation typically observed among the windows of the constituent TCP flows, and hence, suggest the use of the instantaneous queue occupancy in practical RED queues
Keywords
Algorithms, Computer simulation, Correlation methods, Jitter, Network protocols, Telecommunication traffic
Discipline
Software Engineering
Research Areas
Software and Cyber-Physical Systems
Publication
ICC 2001: Proceedings of IEEE International Conference on Communications, Helsinki, Finland, June 11-14
First Page
1817
Last Page
1823
ISBN
9780780370982
Identifier
10.1109/ICC.2001.937105
Publisher
IEEE
City or Country
Piscataway, NJ
Citation
MISRA, Archan; OTT, Teunis; and BARAS, John.
Effect of Exponential Averaging on the Variability of a RED Queue. (2001). ICC 2001: Proceedings of IEEE International Conference on Communications, Helsinki, Finland, June 11-14. 1817-1823.
Available at: https://ink.library.smu.edu.sg/sis_research/716
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://doi.org/10.1109/ICC.2001.937105