A novel algorithm to achieve bandwidth fairness of RED with packet size consideration
Ching-han Yu, Chun‐Liang Lin · 2012
Random-early-detection (RED) is widely applied in network nodes for congestion control. It randomly drops packets to prevent congestion from occurring, while keeping high bandwidth utilization at the same time. Unfortunately, RED provides little protection against aggressive flows from consuming most of the bandwidth. BF-RED was introduced in the literature to address the problem, but it calculated packet drop history only in number, ignoring the sizes of the dropped packets. That is, BF-RED still suffers bandwidth unfairness when packet size varies. In this paper, we introduce a new algorithm named bandwidth-fair-considering-packet-size-RED (BF-PS-RED) to further improve bandwidth fairness. Similar to BF-RED, BF-PS-RED raises the dropping probability according to its drop-weight, but it further adjusts dropping probability according to its average packet size. The simulation shows that BF-PS-RED can effectively guarantee fairness not only in packet numbers but also packet sizes.