A Fairness Algorithm Based on Flow for Register Insertion Ring

Shengyuan Zhou; Xing Wei

ChinaCom2008-Optical Communications and Networking Symposium

Research Article

A Fairness Algorithm Based on Flow for Register Insertion Ring

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2008.4685147,
    author={Shengyuan Zhou and Xing Wei},
    title={A Fairness Algorithm Based on Flow for Register Insertion Ring},
    proceedings={ChinaCom2008-Optical Communications and Networking Symposium},
    publisher={IEEE},
    proceedings_a={CHINACOM2008-OCN},
    year={2008},
    month={11},
    keywords={},
    doi={10.1109/CHINACOM.2008.4685147}
}

Shengyuan Zhou
Xing Wei
Year: 2008
A Fairness Algorithm Based on Flow for Register Insertion Ring
CHINACOM2008-OCN
IEEE
DOI: 10.1109/CHINACOM.2008.4685147

Shengyuan Zhou¹^,*, Xing Wei²^,*

1: School of Information and Communications Guilin University of Electronic Technology Guilin, 541004, China
2: Department of Mathematics and Software Sichuan Normal University Chengdu, 610064, China

*Contact email: zhoushy@gmail.com, wxwxwx_3@sina.com

Abstract

Resilient Packet Ring (RPR) is a metropolitan area network technology for data transfer based on ring configuration and is standardized as IEEE 802.17. RPR provides a local fairness, Spatial Reuse and high bandwidth utilization. And fairness algorithm is very important for RPR. RPR can be regarded as dual-ring of Register Insertion Ring (RIR). In this paper we revise our former algorithm for RPR, and adapt it to a single RIR for more generality .The new solution uses only 1/8 cost of that of the former. The simulation results match and verify the theoretic analysis.

Published: 2008-11-21
Publisher: IEEE
Modified: 2010-05-16

: http://dx.doi.org/10.1109/CHINACOM.2008.4685147