PRED:A New Queue Management Algorithm with Priority and Self-Adaptation
Zengzhi Li · Dianzi xuebao · 2004
With various multimedia applications rapidly advanced in the current INTERNET,the frequent occurrence of congestion has led many researchers to re-examine the issue of congestion control.At present,the congestion control technologies we master and use adopt end-to-end control which regards TCP as core and is based on window.However,this art has its own drawbacks such as high packet loss,low response speed etc.In this study,the authors give a queue managing algorithm based on priority and self-adaptation.The algorithm is called Priority Random Early Detection (PRED).The algorithm can make router more accurately schedule queue.The primary parameter of algorithm can adapt dynamic change of network load in true surroundings.Validly,it avoids the drawbacks of congestion control we master.Experiments prove,under the same configurations,that PRED algorithm is better than end-to-end congestion control arts in terms of reducing the rate of packet loss and oscillation of queue.