loading...
High Performance Fair Bandwidth Allocation Algorithm for Resilient Packet Ring
Xi?an, China March 27-March 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2003.119291417 th International Conference on Adv ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Peng Yue, Xidian University
Zengji Liu, Xidian University
Jing Liu, Xidian University
IEEE is currently standardizing a new high-speed backbone technology for MANs--Resilient Packet Ring (RPR). A key performance objective of RPR is to achieve high utilization, spatial reuse, and fairness simultaneously. However, the algorithms proposed in current draft standards have some critical limitations. As shown in unbalanced traffic scenario, drafts RPR algorithm will suffer from dramatic bandwidth oscillations within nearly the entire range of the link capacity. In this paper, we propose a new dynamic bandwidth allocation algorithm called Distributed Bandwidth Reallocated in Rings (DBRR), which is based on approximately virtual-time. It shows that with fairness information propagated along the ring, each node can remotely approximate the ideal fair rate for its own traffic at each downstream link, and the whole ring can obtain the maximum spatial reuse and nearly lossless throughput.
Citation:
Peng Yue, Zengji Liu, Jing Liu, "High Performance Fair Bandwidth Allocation Algorithm for Resilient Packet Ring," aina, pp.415, 17 th International Conference on Advanced Information Networking and Applications (AINA'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.