Fair Early Drop for the Fair Treatment of Short-lived Flows

摘要：

In this paper an extension to the Fair Early Drop (FED) algorithm is proposed for the preferential treatment of short-lived flows (SLF) over long-lived flows (LLF)- So that, SLFs are allowed to slip quickly through the network, while LLFs fills in the gaps. FED will place a packet belonging to a SLF in the queue regardless of how many packets belonging to this flow exist in the queue. SLFs are bursty in nature, hence FED aims to accommodate and absorb these bursts. It is only under heavy congestion (i.e. queue overflow) that SLFs will suffer packet loss. In this case, not only SLFs, but all incoming traffic will suffer degradation in performance. A performance evaluation of the extended FED algorithm with other algorithms was conducted. FED demonstrated the best overall performance amongst those tested.

关键词： core network fairness active queue management bandwidth Long-lived flows Short-lived flows

作者: Ghadah Abdullah Aldabbagh Miguel Rio

作者单位: Department of Electronic and Electrical Engineering University College London London, United Kingdom

会议类型: 国际会议

会议名称: 2011 International Conference on Information and Computer Networks(ICICN 2011)(2011年信息与计算机网络国际会议)

会议地点: 贵阳

会议语种:英文

页码: 96-102

在线出版日期: 2011-01-26（万方平台首次上网日期，不代表论文的发表时间）