Share Email Print

Proceedings Paper

A novel fairness algorithm based on rate estimation in resilient packet ring
Author(s): Xiaobo Zhou; Depeng Jin; Lieguang Zeng
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The new requirements of Metropolitan Area Networks (MANs) have resulted in the emergence of new data transport technology, Resilient Packet Ring (RPR). The issue of fairness is one of the key technologies in RPR. Whereas traditional definitions for fairness are not applicable for RPR, a fairness conception for RPR based upon ingress aggregated flow is presented in this paper. Then fairness algorithms described in the draft of IEEE standard for RPR is analyzed. In order to overcome the defect under condition of unbalanced data stream, an improvement of the fairness algorithm named RPR-RE which adopts the rate estimation is produced to achieve better performance. At last, the simulation is made and the results are given to prove the conclusion that RPR-RE could eliminate the throughput oscillation approximately compared with the algorithm defined in IEEE standard draft under the scenarios with unbalanced flow. Furthermore, RPR-RE algorithm could implement the fairness between the nodes when multiple congested nodes exist in the ring.

Paper Details

Date Published: 15 April 2004
PDF: 9 pages
Proc. SPIE 5282, Network Architectures, Management, and Applications, (15 April 2004); doi: 10.1117/12.520236
Show Author Affiliations
Xiaobo Zhou, Tsinghua Univ. (China)
Depeng Jin, Tsinghua Univ. (China)
Lieguang Zeng, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 5282:
Network Architectures, Management, and Applications
S. J. Ben Yoo; Kwok-wai Cheung; Yun-Chur Chung; Guangcheng Li, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?