International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Model Based Analysis for Operative Design of Weighted Fair Queuing in Dynamic Deficit Round Robin Pattern

Author : Manish Vyas ¹ Dr. Saurabh Jain ²

Date of Publication :7th September 2016

Abstract: In design of network scheduler algorithms, one of significant objective is improved processor utilization in fair manner. Therefore when router scheduling algorithms are designed, certain multiplexing schemes are concerned such that router can achieve fair bandwidth allocation during data flow with minimization of packet delay, packet loss and uncontrolled transmission rate. To attain this objective an extensive Deficit Round Robin scheduling scheme is derived in this paper along with fair queuing as an isolation mechanism to approximate generalized processor sharing. For analysis and comparative study markov chain model is used.

Reference :

1. Shreedhar, M. and Varghese, G.(1996): Efficient Fair Queuing using Deficit Round Robin, IEEE/ACM Transections on networking, Vol. 4, No. 3
2. Tsao, S. and Lin, Y.(2001): Pre-order Deficit Round Robin: A New Scheduling Algorithm For Packet-Switched Networks, Elsevier Science B.V. Lenzini, L., Mingozzi, E. and Stea, G.(2007): Performance Analysis of Modified Deficit Round Robin Schedulers , Journal of High Speed Networks IOS Press
3. Ayaz, S., Hoffmann,F., Germany, R.and Dresslerz, F.(2011): Analysis of Deficit Round Robin Scheduling for Future Aeronautical Data Link, IEEE 22nd International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC)
4. He, Y., Gao. L., Liu, G. and Liu, Y.(2013): A Dynamic Round-robin Packet Scheduling Algorithm, International Conference on Computer Science and Electronics Engineering (ICCSEE)
5. Stoica, I.,Shenker,S. and Zhang, H.(1998): CoreStateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Network, ACM Sigcomm, International Conference Vancouver, Canada
6. So-In, C. , Jain, R. and Al Tamimi, A.K. (2010): Deficit Round Robin with Fragmentation Scheduling to Achieve Generalized Weighted Fairness for Resource Allocation, http://www.mdpi.com/1999-5903/2/4/446
7. Iraji, M.S.(2015): Time Sharing Algorithm With Dynamic Weighted Harmonic Round Robin, Journal of Asian Scientific Research ,Vol. 5, No. 3
8. Suresh, B., Reddy, P. and Chakravarthy, C.K.(2011): Variable Quantum Deficit Round Robin Scheduling For Improved Fairness In Multihop Networks, International Journal of Distributed and Parallel Systems (IJDPS) Vol.2, No.1
9. Ramabhadran, S.and Pasquale, J. (2006):The Stratified Round Robin Scheduler: Design, Analysis and Implementation, IEEE/ACM Transactions on Networking Vol. 14, No. 6
10. Elshaikh, M. A., Othman,M., Shamala, S. and Desa, J(2006).: A New Fair Weighted Fair Queuing Scheduling Algorithm in Differentiated Services Network, International Journal of Computer Science and Network Security, Vol. 6, No.11.
11. Chakravarthy, C.K.. and Reddy, P.(2009): Modified Opportunistic Deficit Round Robin Scheduling for improved QOS, International Journal of Computer Science and Information Security, Vol. 6, No. 2
12. Wang,Y. and Tseng, Y.(2006): Packet Fair Queuing Algorithms for Wireless Networks, http://people.cs.nctu.edu.tw/~wangyc/publications/ books/b001-nova05-wfq.pdf
13. Frangioni, A., Galli, L. and Stea, G.(2015): QoS Routing algorithms with worst-case delay through its performance analysis, https://www.researchgate.net/publication/2892484 37
14. Vyas, M. and Jain, S.(2016): Performance Analysis of Elaborated Round Robin Scheme by Linear Data Model, International Journal of Innovative Research in Computer and Communication Engineering, Vol. 4, No. 6
15. Vyas, M. and Jain, S.(2016): Comparative Study of Extensive Round Robin Scheduling by Data Model Approach under Markov Chain, International Journal of Recent Research Aspects, Vol. 3, No. 2
16. Shukla, D. and Jain, S. (2007): A Markov chain model for multi-level queue scheduler in operating system,Proceedings of the International Conference on Mathematics and Computer Science, ICMCS07, pp. 522-526