Fast-fair handling of flows Online publication date: Sun, 08-Jan-2017
by Ageliki Tsioliaridou; Chi Zhang; Christos Liaskos; Vassilios Tsaoussidis
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 18, No. 1, 2017
Abstract: Allocating fairly the maximum available bandwidth among competing flows is an important problem as it allows maximising system throughput and fairness. Given the dynamic nature of traffic load in current internet and the short duration of most modern applications, fast convergence to fairness is necessitated. In this paper, we use fairness as the major criterion to adjust traffic and present a novel congestion control scheme which allows each flow independently to estimate efficiently: 1) its deviation from the fair-share; 2) adjust its window to its fair-share. In our model, no flow is aware of the number of competitors in the channel, no flow is aware of the bandwidth and buffer capacity; however, the system reaches to equilibrium state fast, based on throughput measurements. Simulation results confirm that the proposed congestion scheme promotes fast system fairness without damaging system efficiency and responsiveness.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook