Analysis of fair rate calculations in resilient packet ring aggressive mode |
| |
Authors: | Arash Shokrani,Jé rô me Talim |
| |
Affiliation: | Broadband Networks Laboratory, Department of Systems and Computer Engineering, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada |
| |
Abstract: | Resilient packet ring (RPR) standardized as IEEE 802.17 is a new medium access control (MAC) protocol for metro-ring networks. RPR supports spatial reuse which increases the achieved throughput but it can also result in congestion and starvation of nodes on the ring. Therefore, it is necessary to employ mechanisms to enforce a fair allocation of the ring bandwidth in RPR. In order to maintain fairness among nodes, a fairness algorithm is deployed at each RPR node. When a node detects congestion, it calculates a fair rate which is advertised to all upstream nodes contributing to congestion. Upon receiving the fair rate, the upstream nodes limit the rate of their injected traffic to the advertised fair rate. Consequently, the congested node can utilize the unused capacity and add its local traffic to the ring. In this paper, we develop an analytical model for fair rate calculation in the RPR aggressive mode fairness algorithm in the parking-lot scenario. This model provides an insight on dynamics of the RPR fairness algorithm and can be used to evaluate its performance. We investigate this problem in two cases. First, we assume that the link propagation delay is zero and derive the fair rate equations for this ideal case. We then consider the link propagation delay and develop a more realistic model. 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. |
| |
Keywords: | Resilient packet rings (RPR) Fairness algorithms Convergence time Nonlinear control systems |
本文献已被 ScienceDirect 等数据库收录! |
|