VRED: An improvement over RED algorithm by using queue length growth velocity

سال انتشار: 1391
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 371

فایل این مقاله در 8 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_JACR-4-1_001

تاریخ نمایه سازی: 16 شهریور 1395

چکیده مقاله:

Active Queue Management (AQM) plays an important role in the Internetcongestion control. It tries to enhance congestion control, and to achieve tradeoffbetween bottleneck utilization and delay. Random Early Detection (RED) is the mostpopular active queue management algorithm that has been implemented in the inInternet routers and is trying to supply low delay and low packet loss. REDalgorithm uses only the average queue length as a congestion meter to triggerpacket dropping or packet marking as a congestion feedback. Since the averagequeue length considers only long–term behavior of any queue, this approach fails tosee instantaneous changes of the queue length and hence its reaction is not fastenough. This paperincludes another meter i.e. queue length growth velocity tomeasure congestion level in the router. This leads to fast reaction to the congestionand hence improves the network performance. Simulation results show that theproposed algorithm outperforms RED algorithm in terms of number of droppedpackets and bottleneck utilization.

نویسندگان

Shahram Jamali

Computer Engineering Department, University of MohagheghArdabili, Ardabil, Iran

Bita Alipasandi

Department of Computer Engineering, Zanjan Branch, Islamic Azad University, Zanjan, Iran

Neda Alipasandi

Sama technical and vocational training college, Islamic Azad University,Ardabil Branch, Ardabil, Iran