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.
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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.