Improved round robin queue management algorithm for elastic and inelastic traffic flows
by S. Nandhini
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 6, No. 2, 2015

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.

Online publication date: Wed, 04-Nov-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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