Resilient Packet Ring (RPR) is MAN technology with two counter-rotating rings that multiple stations share the bandwidth. The stations on ring must negotiate the allowed rate that they can transmit fairness eligible t...Resilient Packet Ring (RPR) is MAN technology with two counter-rotating rings that multiple stations share the bandwidth. The stations on ring must negotiate the allowed rate that they can transmit fairness eligible traffic based on the total amount of uncommitted bandwidth. RPR draft employs distributed bandwidth control algorithm in order to assure global fairness. In this paper, we suggest a new fairness control algorithm termed Congestion Distributed Fairness Algorithm (CDFA) that exhibits better pe...展开更多
A congestion control algorithm is proposed for resilient packet ring (RPR) in this paper. In this algorithm, nonlinear explicit rate feedback control is used to ensure fast convergence and smooth equilibrium behavior....A congestion control algorithm is proposed for resilient packet ring (RPR) in this paper. In this algorithm, nonlinear explicit rate feedback control is used to ensure fast convergence and smooth equilibrium behavior. The algorithm combines explicit rate control with a deficit round robin (DRR) scheduler, which not only ensures fairness, but also avoids the implementation difficulties of explicit rate control algorithms. The algorithm has good features of fairness, fast convergence, smooth equilibrium, low queue depth, and easy implementation. It is insensitive to the loss of congestion control packets and can adapt to a wide range of link rates and network scales. It has solved the unbalanced traffic problem of spatial reuse protocol (SRP). The algorithm can be implemented on the multi-access control layer of RPR nodes to ensure fair and efficient access of the best-effort traffic.展开更多
文摘Resilient Packet Ring (RPR) is MAN technology with two counter-rotating rings that multiple stations share the bandwidth. The stations on ring must negotiate the allowed rate that they can transmit fairness eligible traffic based on the total amount of uncommitted bandwidth. RPR draft employs distributed bandwidth control algorithm in order to assure global fairness. In this paper, we suggest a new fairness control algorithm termed Congestion Distributed Fairness Algorithm (CDFA) that exhibits better pe...
基金Supported by the National Natural Science Foundation of China(No.69896242)
文摘A congestion control algorithm is proposed for resilient packet ring (RPR) in this paper. In this algorithm, nonlinear explicit rate feedback control is used to ensure fast convergence and smooth equilibrium behavior. The algorithm combines explicit rate control with a deficit round robin (DRR) scheduler, which not only ensures fairness, but also avoids the implementation difficulties of explicit rate control algorithms. The algorithm has good features of fairness, fast convergence, smooth equilibrium, low queue depth, and easy implementation. It is insensitive to the loss of congestion control packets and can adapt to a wide range of link rates and network scales. It has solved the unbalanced traffic problem of spatial reuse protocol (SRP). The algorithm can be implemented on the multi-access control layer of RPR nodes to ensure fair and efficient access of the best-effort traffic.
