TY - GEN
T1 - Allocating bandwidth in the resilient packet ring networks by PI controller
AU - Alharbi, Fahd
AU - Ansari, Nirwan
PY - 2011
Y1 - 2011
N2 - 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, SONET and Ethernet, respectively. 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 parameter settings. In this paper, we apply Control Theory to solve the fairness issue. We construct a PI controller to dynamically adjust the fair rate in order to eliminate the state of congestion and to converge to the optimal fair rate.
AB - 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, SONET and Ethernet, respectively. 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 parameter settings. In this paper, we apply Control Theory to solve the fairness issue. We construct a PI controller to dynamically adjust the fair rate in order to eliminate the state of congestion and to converge to the optimal fair rate.
KW - Ethernet
KW - PI
KW - RPR
KW - SONET
KW - spatial reuse
UR - http://www.scopus.com/inward/record.url?scp=79959921146&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79959921146&partnerID=8YFLogxK
U2 - 10.1109/SARNOF.2011.5876463
DO - 10.1109/SARNOF.2011.5876463
M3 - Conference contribution
AN - SCOPUS:79959921146
SN - 9781612846811
T3 - 2011 34th IEEE Sarnoff Symposium, SARNOFF 2011
BT - 2011 34th IEEE Sarnoff Symposium, SARNOFF 2011
T2 - 2011 34th IEEE Sarnoff Symposium, SARNOFF 2011
Y2 - 3 May 2011 through 4 May 2011
ER -