Share Email Print
cover

Proceedings Paper

An improved fairness algorithm for resilient packet ring network
Author(s): Wenli Tang; Liren Zhang; P. Shum; Songnian Fu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Among all kinds of metro-ring networks, resilient packet ring (RPR) technology possesses excellent market prospect which is integrated with many advantages, such as the intelligence of Internet Protocol (IP), economy of Ethernet and high bandwidth and reliability of SONET/SDH. A RPR network is a dual ring topology with two unidirectional counter-rotating ringlets. This ring network architecture and associated protocol has been standardized by the IEEE 802.17 working group in 2004. One of the main requirements for RPR is to provide fairness in bandwidth allocation for each node, which is ensured by the implementation of a fairness policy in a distributed manner. However, the existing fairness mechanisms suffer from severe oscillations under certain conditions, such as unbalanced traffic scenario and noticeable time delay. In this paper, an improvement to current aggressive fairness algorithm is proposed, especially for networks with noticeable time delay. And the simulation results show that the system performance can be sustained by adjusting the compensating factor accordingly with respect to the delay.

Paper Details

Date Published: 28 September 2006
PDF: 8 pages
Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 635410 (28 September 2006); doi: 10.1117/12.687746
Show Author Affiliations
Wenli Tang, Nanyang Technological Univ. (Singapore)
Liren Zhang, Nanyang Technological Univ. (Singapore)
P. Shum, Nanyang Technological Univ. (Singapore)
Songnian Fu, Nanyang Technological Univ. (Singapore)


Published in SPIE Proceedings Vol. 6354:
Network Architectures, Management, and Applications IV
Yong Hyub Won; Gee-Kung Chang; Ken-ichi Sato; Jian Wu, Editor(s)

© SPIE. Terms of Use
Back to Top