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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Communication Networks and Distributed Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
