DMCA
JOURNAL OF COMMUNICATIONS AND NETWORKS 1 Active Queue Management using Adaptive (2002)
Cached
Download Links
BibTeX
@MISC{Verma02journalof,
author = {Rahul Verma and Aravind Iyer and Abhay Kar},
title = {JOURNAL OF COMMUNICATIONS AND NETWORKS 1 Active Queue Management using Adaptive},
year = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Random Early Detection (RED) [1] is an active queue management scheme which has been de-ployed extensively to reduce packet loss during congestion. Although RED can improve loss rates, its performance depends severely on the tuning of its operating parameters. The idea of adaptively vary-ing RED parameters to suit the network conditions has been investigated in [2], where the maximum packet dropping probability maxp has been varied. This paper focuses on adaptively varying the queue weight wq in conjunction with maxp to improve the performance. We propose two algorithms viz., wq−thresh and wq−ewma to adaptively vary wq. The performance is measured in terms of the packet loss percentage, link utilization and stability of the instantaneous queue length. We demonstrate that varying wq and maxp together results in an overall improvement in loss percentage and queue stability, while maintaining the same link utilization. We also show that maxp has a greater influence on loss percentage and queue stability as compared to wq, and that varying wq has a positive influence on link utilization. Index Terms Random Early Detection (RED), active queue management, next generation Internet.
Keyphrases
active queue management journal communication network link utilization queue stability loss percentage operating parameter vary-ing red parameter positive influence instantaneous queue length active queue management scheme vary wq loss rate index term random early detection maximum packet next generation internet wq thresh probability maxp overall improvement packet loss percentage algorithm viz random early detection wq ewma packet loss network condition
