Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06)   pp. 1086-1091
A DT-based Adaptive BLUE Algorithm

Full Article Text: Download PDF of full textBuy this article

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISDA.2006.54
Send link to a friend

Abstract
As a classical active queue management algorithm, compared with RED, BLUE has many advantages. It uses packet loss and link idle events to manage congestion. However, there are still some subtle drawbacks in parameter setting for BLUE, especially there is a significant change in the number of connections can cause the queue fluctuate between overflow and underflow. In this paper a new DT-based adaptive BLUE is proposed to improve the property of BLUE. The buffer is managed by dynamic threshold algorithm. The packet -dropping probability is determined by packet loss event, link idle event and the buffer usage ratio. The simulation results demonstrate that the proposed approach can effectively stabilize the queue occupation at a level and improve link utilization. It can mitigate the queue fluctuate which is caused by significant variety of connections.
Additional Information

Citation:  Wei-yan Liu, Shun-yi Zhang, Mu Zhang, Tao Liu, "A DT-based Adaptive BLUE Algorithm," isda, pp. 1086-1091,  Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06),  2006

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback