DocumentCode
459334
Title
Equal Opportunity Fairness in Resilient Packet Rings
Author
Khorsandi, Siavash ; Shokrani, Arash ; Lambadaris, Ioannis
Author_Institution
Department of Computer Engineering, Amirkabir University of Technology, Tehran, Iran. khorsand@cic.aut.ac.ir
Volume
3
fYear
2006
fDate
38869
Firstpage
994
Lastpage
1001
Abstract
Ring Ingress Aggregated with Spatial Reuse (RIAS) has been proposed as a fairness model for Resilient Packet Rings (RPR) where available bandwidth is allocated among traffic flows in max-min sense. In this paper, we show that in a feedback controlled system such as RPR, this may cause severe under-allocation for long-haul flows and may also result in degradation of total ring throughput. To overcome this problem, we introduce the concept of Equal Opportunity (EO) fairness. Application of this model for bandwidth management in RPR is studied and a new stateful distributed algorithm to calculate per-destination fair rates is developed. The proposed scheme is studied both analytically and through simulations. The simulation results show that using the proposed algorithm, intra-station fairness among local flows at every station is significantly improved. In some cases, imbalances up to 55% between long and short flows are completely removed. An improvement of up to 20% in total ring utilization is also observed.
Keywords
Analytical models; Bandwidth; Broadband communication; Communication system traffic control; Computer networks; Equal opportunities; Laboratories; Systems engineering and theory; Throughput; Traffic control; Equal Opportunity; Fairness Model; Intra-Station Fairness; Resilient Packet Ring;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2006. ICC '06. IEEE International Conference on
Conference_Location
Istanbul
ISSN
8164-9547
Print_ISBN
1-4244-0355-3
Electronic_ISBN
8164-9547
Type
conf
DOI
10.1109/ICC.2006.254877
Filename
4024269
Link To Document