Spatial reuse and fairness in resilient packet ring

Ming Jiang; QingJi Zeng; Xu Zhu

doi:10.1117/12.480729

22 August 2002 Spatial reuse and fairness in resilient packet ring

Ming Jiang, QingJi Zeng, Xu Zhu

Proceedings Volume 4908, Metro and Access Networks II; (2002) https://doi.org/10.1117/12.480729
Event: Asia-Pacific Optical and Wireless Communications 2002, 2002, Shanghai, China

Abstract

The recent increase in the transmission speed and bandwidth has resulted in the emergence of new networking solution, Resilient Packet Ring. In this paper, we firstly study the spatial reuse protocol in Resilient Packet Ring. Then based on node model, we discuss several access control mechanisms, including traffic shaping and Virtual Destination Queuing. Finally, a new effective fairness algorithm is presented. In order to ensure the requirement of high priority traffic and avoid high priority traffic taking up all of capacities, the algorithm proportionally assigns the fair rate to different traffic in a theoretical optimal way according to the service priority.

Citation Download Citation

Ming Jiang, QingJi Zeng, and Xu Zhu "Spatial reuse and fairness in resilient packet ring", Proc. SPIE 4908, Metro and Access Networks II, (22 August 2002); https://doi.org/10.1117/12.480729

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