Fair Bandwidth Allocation for Responsive and Unresponsive Flows Using Approximate Fairness Dropping Scheme

摘要

In this paper, based on Equivalent Active Flow, we propose a novel technique called Approximate Fairness Dropping, which is able to approximate fairness by containing misbehaving flows' access queue opportunity with low time/space complexity. Unlike most of the existing Active Queue Management schemes (e.g., RED, BLUE, CHOKE), Approximate Fairness Dropping does not drop the packets whose arriving rate is within the maximum admitted rate, so it protects the well-behaving flows against misbehaving ones, moreover, improves the throughput and decreases the queuing delay. Our simulations and analyses demonstrate that this new technique outperforms the existing schemes and closely approximates the "ideal" case, where full state information is needed.