ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 30, Issue 9, 30 June 2007, Pages 2048-2059
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (343 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comcom.2007.04.002    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2007 Elsevier B.V. All rights reserved.

A queue management algorithm for fair bandwidth allocation

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Tetsuji Yamaguchia and Yutaka TakahashiCorresponding Author Contact Information, a, E-mail The Corresponding Author

aDepartment of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida-hommachi, Sakyo-ku, Kyoto 606-8501, Japan


Received 21 April 2006; 
revised 19 March 2007; 
accepted 1 April 2007. 
Available online 10 April 2007.

Abstract

In this paper, a stateless active queue management algorithm called “PUNSI” which aims to achieve fair bandwidth allocation in congested routers is proposed. This algorithm prevents unresponsive flows from dominating available bandwidth shared with responsive flows by penalizing packets from unresponsive flows with a higher probability than those from responsive flows. It is motivated by the observation that unresponsive flows tend to generate traffic of higher rates than responsive ones and that, when a packet is dropped due to buffer overflow, fellow packets from the same flow seem to be found in the buffer among those having joined recently. Simulation experiments show that the algorithm discards packets from unresponsive flows effectively and achieves pretty good fair share among flows with low implementation complexity.

Keywords: Stateless information; Unresponsive flows; Packet scheduling

Article Outline

1. Introduction
2. Related work
3. The algorithm
3.1. CHOKe
3.2. Shortcomings of CHOKe
3.3. PUNSI
4. Performance evaluation
4.1. UDP flow generating CBR traffic
4.2. UDP flow generating on–off CBR traffic
4.3. Performance in a multi-hop network
5. Tuning PUNSI
5.1. Parameters same as RED
5.2. Determination of θ
6. Conclusions and future work
References
Vitae

























Corresponding Author Contact InformationCorresponding author. Tel.: +81 75 753 5503; fax: +81 75 753 3358.

Computer Communications
Volume 30, Issue 9, 30 June 2007, Pages 2048-2059
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.