By Topic

Computational complexity reduction of an adaptive congestion control in Active Queue Management

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

2 Author(s)
Ostadabbas, S. ; Dept. of Electr. Eng., Sharif Univ. of Technol., Tehran ; Haeri, M.

Active queue management (AQM) policies provide an early indication of incipient congestion to the source. In this paper, we propose a new AQM policy that predicts the instantaneous queue length at the next time instant using adaptive filtering technique. To use this algorithm in fast routers, we have reduced its computational complexity. The proposed method uses a simple linear function as adaptive rule. We show that this adaptive congestion control method is able to control the oscillations in the instantaneous queue length. We compare the performance of our method with the other well-known AQM methods such as RED and PI which are also simulated by MATLAB. We also compare the computational complexity of these algorithms with each other.

Published in:

Control and Decision Conference, 2008. CCDC 2008. Chinese

Date of Conference:

2-4 July 2008