The Resilient Packet Ring (RPR), defined under IEEE 802.17, has been proposed as a high-speed backbone technology for metropolitan area networks. RPR is introduced to mitigate the underutilization and unfairness problems associated with the current technologies such as SONET and Ethernet. The key performance objectives of RPR are to achieve high bandwidth utilization, optimum spatial reuse on the dual rings, and fairness. The challenge is to design an algorithm that can react dynamically to the traffics in achieving these objectives. The RPR fairness algorithm is comparatively simple, but it poses some critical limitations that require further investigation and remedy. One of the major problems is that the amount of bandwidth allocated by the algorithm oscillates severely under unbalanced traffic scenarios. These oscillations are barrier to achieving spatial reuse and high bandwidth utilization. Moreover, the performance of the RPR fairness algorithm is very sensitive to the algorithm parameters. In this paper, we apply Control Theory to solve the fairness issue, and construct a Proportional controller to dynamically adjust the fair rate in order to eliminate the state of congestion and to converge to the optimal fair rate.
[1]
B. Achiriloaie,et al.
VI REFERENCES
,
1961
.
[2]
Nirwan Ansari,et al.
Low complexity distributed bandwidth allocation for resilient packet ring networks
,
2004,
2004 Workshop on High Performance Switching and Routing, 2004. HPSR..
[3]
Martin Maier,et al.
Optical Switching Networks: Resilient packet ring
,
2008
.
[4]
Stein Gjessing,et al.
IEEE 802.17 resilient packet ring tutorial
,
2004,
IEEE Communications Magazine.
[5]
Edward W. Knightly,et al.
The IEEE 802.17 media access protocol for high-speed metropolitan-area resilient packet rings
,
2004,
IEEE Network.