TY - GEN
T1 - Improvement to fairness algorithm of resilient packet ring network
AU - Tang, Wenli
AU - Zhang, Liren
AU - Fu, Songnian
AU - Shum, P.
AU - Liu, Shuang
PY - 2006
Y1 - 2006
N2 - Resilient Packet Ring (RPR) is a more promising solution to the bottleneck of metropolitan-area networks (MANs). The ring network architecture and associated protocol has been standardized by the IEEE 802.17 working group in 2004. To achieve high bandwidth utilization, optimum spatial reuse and fairness simultaneously, a policy of fair bandwidth assignment must be implemented in current RPR network. The existing fairness mechanisms suffer from severe oscillations under certain conditions, such as unbalanced traffic scenario and noticeable time delay. With our proposed fairness algorithm, the system performance of the three-node unbalanced traffic scenario, where the traffic loads are fixed, can be sustained by simply adjusting the compensating factor with respect to the time delay. In this paper, the time delay is constant, we investigate how this compensating factor should be adjusted with respect to the degree of unbalance. Furthermore, we study a four-node scenario, each node-to-node pair has different time-delay as well as unbalance degree. The simulation results show that the system performance remains excellent with the guidelines summarized.
AB - Resilient Packet Ring (RPR) is a more promising solution to the bottleneck of metropolitan-area networks (MANs). The ring network architecture and associated protocol has been standardized by the IEEE 802.17 working group in 2004. To achieve high bandwidth utilization, optimum spatial reuse and fairness simultaneously, a policy of fair bandwidth assignment must be implemented in current RPR network. The existing fairness mechanisms suffer from severe oscillations under certain conditions, such as unbalanced traffic scenario and noticeable time delay. With our proposed fairness algorithm, the system performance of the three-node unbalanced traffic scenario, where the traffic loads are fixed, can be sustained by simply adjusting the compensating factor with respect to the time delay. In this paper, the time delay is constant, we investigate how this compensating factor should be adjusted with respect to the degree of unbalance. Furthermore, we study a four-node scenario, each node-to-node pair has different time-delay as well as unbalance degree. The simulation results show that the system performance remains excellent with the guidelines summarized.
KW - Fairness algorithm
KW - Metropolitan Area Network (MAN)
KW - OPNET
KW - Resilient Packet Ring (RPR)
KW - Time delay
KW - Unbalanced traffic scenario
UR - http://www.scopus.com/inward/record.url?scp=33845617527&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845617527&partnerID=8YFLogxK
U2 - 10.1117/12.692574
DO - 10.1117/12.692574
M3 - Conference contribution
AN - SCOPUS:33845617527
SN - 0819464880
SN - 9780819464880
T3 - Proceedings of SPIE - The International Society for Optical Engineering
BT - Broadband Access Communication Technologies
T2 - Broadband Access Communication Technologies
Y2 - 2 October 2006 through 3 October 2006
ER -