In this paper, we propose a fast-convergent fairness scheme in IEEE 802.17 resilient packet ring (RPR) networks. In the proposed scheme, each station could rapidly approach fair rate by estimating the number of unbounded flows at each link. In addition, the fast-convergent scheme could prevent rate oscillations in the RPR aggressive mode scheme under unbalanced traffic. The estimation mechanism is simple and scalable since it is stateless without per-flow management. Through analytical and simulation evaluations our scheme was found to be stable and speedy when compared with 802.17 RPR fairness scheme or the proposed distributed virtual-time scheduling in rings scheme. Our scheme could allocate bandwidth fairly and smoothly among flows and achieve high utilization at the same time in the RPR network.
All Science Journal Classification (ASJC) codes