Allocating Bandwidth Using Fair Random Indication with Discarding Aggressiveness Yardstick (FRIDAY)

摘要

In order to improve the fairness of bandwidth allocation in the Internet, we present an active queue management scheme called Fair Random Indication with Discarding Aggressiveness Yardstick (FRIDAY), and study its performance via combining it with certain scheduling algorithms, e.g., FCFS (First-Come-First-Served) and FQ (Fair Queueing). By calculating the average arriving rate of each flow or a set of merged flows based on EWMA (Exponentially Weighted Moving Average), and discarding packets from the most aggressive flow or flow set randomly according to a dropping probability, FRIDAY is able to (1) provide better fairness than LQD (Longest Queue Drop), RED (Random Early Detection), and TD (Tail Drop), (2) maintain a shorter average waiting time in the queue than LQD and TD, and (3) control the time limit for a bursty traffic to send data continuously without packet dropping. The performances of FRIDAY are validated by ns simulator.