a stable rate-based algorithm for active queue management：一种基于稳定速率的主动队列管理算法.pdfVIP

Computer Communications 28 (2005) 1731–1740 /locate/comcom A stable rate-based algorithm for active queue management a,d b, * c a d Chonggang Wang , Bo Li , Y. Thomas Hou , Kazem Sohraby , Keping Long aDepartment of Electrical Engineering, University of Arkansas, Fayetteville, AR 72701, USA bDepartment of Computer Science, The Hong Kong University of Science and Technology, Hong Kong, China cThe Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA, USA dCOIWIN Research Center, Chongqing University of Posts and Telecommunications, Chongqing, China Received 3 December 2004; accepted 3 December 2004 Available online 18 January 2005 Abstract This paper proposes a rate-based active queue management algorithm or RAQM. It uses the aggregated traffic input rate to calculate packet drop probability according to an exponential rule. The proposed RAQM algorithm works in two modes: queue-independent and queue- dependent. In the queue-independent mode, it only relies on the aggregate traffic input rate to regulate the input rate to the expected value, i.e. expected link utility. In the queue-dependent mode, it also uses the instantaneous queue length to further adjust the packet drop probability and to regulate the queue length to the expected value. We analyze the stability and investigate practical implementation issues of the RAQM. Simulations are carried out to study RA