Share Email Print

Proceedings Paper

A novel fairness algorithm for resilient packet rings
Author(s): Shan Dan; Jie Jin; Yu Yang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 5 December 2005
PDF: 6 pages
Proc. SPIE 6022, Network Architectures, Management, and Applications III, 60222E (5 December 2005); doi: 10.1117/12.635288
Show Author Affiliations
Shan Dan, Tianjin Univ. (China)
Jie Jin, Tianjin Univ. (China)
Yu Yang, Tianjin Univ. (China)

Published in SPIE Proceedings Vol. 6022:
Network Architectures, Management, and Applications III
Kwok-wai Cheung; Gee-Kung Chang; Guangcheng Li; Ken-Ichi Sato, Editor(s)

© SPIE. Terms of Use
Back to Top