Fair packet dropping

Many scheduling algorithms were proposed to provide fair service of flows passing through a buffer before the congested link. As we will show, fairness can be provided only if packets are dropped appropriately, while the fair scheduling algorithms is applied. We propose a novel algorithm for packet dropping in which the oldest packet is dropped (OPD). It will be shown that OPD provides fair service while having the minimal complexity.