DocumentCode
2031984
Title
A definition of general weighted fairness and its support in explicit rate switch algorithms
Author
Vandalore, Bobby ; Fahmy, Sonia ; Jain, Raj ; Goyal, Rohit ; Goyal, Mukul
Author_Institution
Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
fYear
1998
fDate
13-16 Oct 1998
Firstpage
22
Lastpage
30
Abstract
We give a general definition of weighted fairness and discuss how a pricing policy can be mapped to general weighted (GW) fairness. The GW fairness can be achieved by calculating the excess fairshare (weighted fairshare of the left over bandwidth) for each VC. We show how a switch algorithm can be modified to support the GW fairness by using the excess fairshare term. We use ERICA+ as an example switch algorithm and show how it can be modified to achieve the general fairness. Simulations results are presented to demonstrate that, the modified switch algorithm achieves GW fairness. An analytical proof for convergence of the modified ERICA+ algorithm is given in the appendix
Keywords
asynchronous transfer mode; convergence of numerical methods; costing; packet switching; ATM; ERICA+; bandwidth; convergence; excess fairshare; explicit rate switch algorithms; general weighted fairness; modified ERICA+ algorithm; modified switch algorithm; pricing policy; simulations results; virtual channel; weighted fairshare; Asynchronous transfer mode; Bandwidth; Convergence; Distributed algorithms; Erbium; Information science; Pricing; Switches; Testing; Virtual colonoscopy;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Protocols, 1998. Proceedings. Sixth International Conference on
Conference_Location
Austin, TX
Print_ISBN
0-8186-8988-9
Type
conf
DOI
10.1109/ICNP.1998.723722
Filename
723722
Link To Document