Rotating Preference Queues: An Efficient Queue Management Scheme for Fair Bandwidth Allocation

摘要

In this study, an efficient queue management scheme is proposed to achieve fair bandwidth sharing by rotating preference queues (RPQ). RPQ consists of a set of first-in-first-out (FIFO) output queues that are dynamically rotated. In addition, RPQ selects accepted packets and dispatches them to adequate output queues depending on packet distribution and preference. Using simulations, we show that RPQ tends to approach DRR, and it significantly outperforms CSFQ, DDE, CHOKe and FIFO in terms of fairness. RPQ has a complexity of O(1) and is simple to implement in high-speed networks.