Modeling and Analysis of Fair Rate Calculation in Resilient Packet Ring Conservative Mode

Abstract

Resilient Packet Ring (RPR), which is standardized as IEEE 802.17, is a new Medium Access Control (MAC) protocol for high-speed metro-area ring networks. RPR supports spatial reuse and, therefore, maintaining fairness among different nodes in accessing the ring bandwidth is a challenging task in RPR. In order to achieve fairness among nodes, a fairness algorithm is employed at each RPR node. When a node is not given access to the ring, it becomes congested. In this case, the congested node calculates a fair rate which is advertised to all upstream nodes contributing to congestion. When upstream nodes receive the control message, they limit the rate of their injected traffic to the advertised fair rate. Consequently, the congested node will be able to add its traffic to the ring. In this paper, we develop an analytical model for fair rate calculation in the standard RPR Conservative Mode fairness algorithm in the parking-lot scenario. This model can be used to evaluate the performance of the fairness algorithm. We investigate this problem in two cases. First, we assume that the link propagation delay is zero. Then, we consider the link propagation delay and develop a more realistic model. The fair rate equations are derived for both cases. We verify the accuracy of our model by simulation results. Furthermore, we use the developed model to study the impact of various parameters on convergence of the fair rate.