Abstract
In current scenario, network traffic flows need a start-time fair queuing algorithm which is computationally efficient and also which can achieve maximum fairness regardless of variation in a network capacity. To enhance the situation of congestion, an improved round robin IRR queue management algorithm for elastic and inelastic traffic flows is proposed. In this approach, the traffic flows are categorised into elastic traffic flows and in-elastic traffic flows. The scheduling process in the inelastic flows is handled by the BRR scheduler algorithm since they have large capacity requirements and delay constraints and elastic flows will be scheduled using DRR-SFF. The results are simulated with NS-2 and they show consistent improvement in the performance of the network.
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 Mobile Network Design and Innovation
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.
