MFLWQ: a fair and adaptive queue management algorithm for scavenger service

Authors:
Xiaofeng Chen;Lingdi Ping;Zheng Wan;Jian Chen
Affiliations:
College of Computer Science, Zhejiang University, Zhejiang, P.R.C.;College of Computer Science, Zhejiang University, Zhejiang, P.R.C.;College of Computer Science, Zhejiang University, Zhejiang, P.R.C.;College of Computer Science, Zhejiang University, Zhejiang, P.R.C.
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 3
Cited 0

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Quality of Service Control in High-Speed Networks

Quality of Service Control in High-Speed Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a MFLWQ Algorithm for Scavenger Service, which is a non-elevated QoS technique proposed by the Internet2 project. The algorithm balances the bandwidth distribution among Scavenger Service flows by a modified Flow Random Early Detection (FRED) algorithm; estimates active Scavenger Service flow number by the variable nactive in FRED and accordingly tunes the bandwidth allocation between SS flows and BE flows in a logarithmical way to reach better performance and robustness. Simulations show that the algorithm provides more appropriate bottom bandwidth guarantee for Scavenger Service flows when protecting Best-Effort flows well and extends the applicability of Scavenger service to no-adaptive traffic like UDP.