A novel fairness algorithm for resilient packet rings

Shan Dan; Jie Jin; Yu Yang

doi:10.1117/12.635288

5 December 2005 A novel fairness algorithm for resilient packet rings

Shan Dan, Jie Jin, Yu Yang

Proceedings Volume 6022, Network Architectures, Management, and Applications III; 60222E (2005) https://doi.org/10.1117/12.635288
Event: Asia-Pacific Optical Communications, 2005, Shanghai, China

Abstract

The Resilient Packet Ring (RPR), standardized by the IEEE 802.17 work group, is a new topology technology for bidirectional packet-switched metropolitan backbone networks. The key objective of RPR is to achieve high bandwidth utilization, optimum spatial reuse and fairness simultaneously. Fairness algorithm is one of the core technologies of RPR. One major problem is that the bandwidth allocated by the algorithm oscillates tremendously and permanently under unbalanced traffic scenarios. So the challenge is to design a fairness algorithm in the distributed nature. This paper presented a new dynamic bandwidth allocation algorithm and the analytic results show it is effective in reducing the oscillation in RPR with low computational and time complexity.

Citation Download Citation

Shan Dan, Jie Jin, and Yu Yang "A novel fairness algorithm for resilient packet rings", Proc. SPIE 6022, Network Architectures, Management, and Applications III, 60222E (5 December 2005); https://doi.org/10.1117/12.635288

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

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.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available