By Topic

PFED: a prediction-based fair active queue management algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wenyu Gao ; Sch. of Inf. Sci. & Eng., Central South Univ., Changsha, China ; Jianxin Wang ; Jianer Chen ; Songqiao Chen

In this paper, we propose a novel active queue management algorithm PFED, which is based on network traffic prediction. The main properties of PFED are: (1) stabilizing queue length at a desirable level with consideration of future traffic, and using a MMSE (minimum mean square error) predictor to predict future network traffic; (2) imposing effective punishment upon misbehaving flow with a full stateless method; (3) maintaining queue arrival rate bounded by queue service rate through more reasonable calculation of packet drop probability. To verify the performance of PFED, PFED is implemented in NS2 and is compared with RED and CHOKe with respect to different performance metrics. Simulation results show that PFED outperforms RED and CHOKe in stabling instantaneous queue length and in fairness. It is also shown that PFED enables the link capacity to be fully utilized by stabilizing the queue length at a desirable level, while not incurring excessive packet loss ratio.

Published in:

Parallel Processing, 2005. ICPP 2005. International Conference on

Date of Conference:

14-17 June 2005