Skip Navigation
York U: Redefine the PossibleHOME | Current Students | Faculty & Staff | Research | International
Search »FacultiesLibrariesCampus MapsYork U OrganizationDirectorySite Index
Future Students, Alumni & Visitors
2006 Technical Reports

RQM: A new rate-based active queue management algorithm

Jeff Edmonds, Suprakash Datta, Patrick Dymond and Kashif Ali

Technical Report CSE-2006-09

York University

September 1, 2006


In this paper, we investigate a new active queue management algorithm RQM based on the rates of traffic passing through a router instead of the buffer occupancy inside a router. Our algorithm uses a novel method of estimating the number of active sessions without explicitly maintaining or using per-session states at the routers. We prove that our algorithm results in fair allocations of bandwidth to competing sessions, under some simplifying assumptions. Using simulations, we show that our algorithm is superior to the well-known RED and REM algorithms in many scenarios. Our algorithm performs particularly well when the number of active sessions is very high.

Download paper in PDF format.

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.