Abstract The Core Stateless Fair Queuing (CSFQ) is a distri buted approach of Fair Queuing (FQ). The limitation s include its inability to estimate fairness during large tra ffic flows, which are short and bursty (VoIP or vid eo), and also it utilizes the single FIFO queue at the core router. For improving the fairness and efficiency, we propose an Enhanced Core Stateless Fair Queuing (ECSFQ) with multiple queue priority schedu ler. Initially priority scheduler is applied to the flows entering the ingress edge router. If it is real time flow i.e., VoIP or video flow, then the packets are given high er priority else lower priority. In core router, for higher priority flow s the Multiple Queue Fair Queuing (MQFQ) is applied that allows a flow to utilize multiple queues to transmit the packets. In case of lower priority, the normal max1min fairnes s criterion of CSFQ is applied to perform probabilistic packet dropping. B y simulation results, we show that this technique improves the throughput of real time flows by reducing the packet loss and delay.  

References

[1] Banchs A. and Perez X., Distributed Weighted Fair Queuing in 802.11 Wireless LAN, in Proceedings of IEEE International Conference on Communications , Germany, vol. 5, pp. 3121- 3127, 2002.

[2] Elshafei A. and Baroudi U., Wireless Fair Queuing Algorithm for Window-Based Link Level Retransmission, in Proceedings of IEEE/ACS International Conference on Computer Systems and Applications , Doha, Qatar, pp. 386-391, 2008.

[3] Elshaikh M., Othman M., Shamala S., and Desa J., A New Fair Weighted Fair Queuing Scheduling Algorithm in Differentiated Services Network, the International Journal of Computer Science and Network Security , vol. 6, no. 11, pp. 267-271, 2006.

[4] Fengnet., available at : http://fengnet.com/book/ Optimizing-Applications /ch05lev1sec7.html, last visited 2011.

[5] Georg M., Jechlitschek C., and Gorinsky S., Improving Individual Flow Performance with Multiple Queue Fair Queuing, in Proceedings of the 15 th IEEE International Workshop on Quality of Service , Evanston, USA, pp. 141-144, 2007.

[6] Hwang I., Hwang B., and Ding C., Adaptive Weighted Fair Queueing with Pritority (AWFQP) Scheduler for Diffserv Networks, Journal of Informatics & Electronics , vol. 2, no. 2, pp. 15- 19, 2008.

[7] Ioannou A. and Katevenis M., Pipelined Heap (Priority Queue) Management for Advanced Scheduling in High-Speed Networks, IEEE/ACM Transactions on Networking , vol. 15, no. 2, pp. 450-461, 2007.

[8] Jin J., Wang W., and Palaniswami M., Utility Max-Min Fair Resource Allocation for Communication Networks with Multipath Routing, Computer Communications , vol. 32, no. 17, pp. 1802-1809, 2009.

[9] Josevski N. and Chilamkurti N., A Stabilized Core-Stateless Fair Queuing Mechanism for a Layered Multicast Network, in Proceedings of International Conference on Networking and Services , California, USA, pp. 16-21, 2006.

[10] Kaur J. and Vin H., End-to-End Fairness Analysis of Fair Queuing Networks, in Proceedings of the 23 rd IEEE Real1Time Systems Symposium , Texas, USA, pp. 49-58, 2002.

[11] Kong C., Guo Z., Ping L., and Peng X., PSRED: A Queue Management Algorithm with Priority Self-adaptive Random Early Detection for Ad- hoc Network, in Proceedings of the International Workshop on Information Security and Application , China, pp. 557-560, 2009.

[12] Matsufuru N. and Aibara R., Efficient Fair Queueing for ATM Networks Using Uniform Round Robin, in Proceedings of the 18 th Annual Joint Conference of the IEEE Computer and Communications Societies , New York, USA, vol. 1, pp. 389-397, 1999.

[13] Mishkoy G., Giordano S., Andronati N., and Bejan A., Priority Queueing Systems with Switchover Times: Generalized Models for QoS and CoS Network Technologies and Analysis, Technical Report , Free International University of Moldova, Moldova, 2006.

[14] Network Simulator, available at: http://www.isi.edu/nsnam/ns, last visited 2011.

[15] Rai I. and Alanyali M., Uniform Weighted Round Robin Scheduling Algorithms for Input Queued Switches, in Proceedings of IEEE International Conference on Communications , vol. 7, pp. 2028-2032, 2001.

[16] Saha D., Mukherjee S., and Tripathi S., Carry- Over Round Robin: A Simple Cell Scheduling Mechanism for ATM Networks, IEEE/ACM Transactions on Networking , vol. 6, no. 6, pp. 779-796, 1998.

[17] Semeria C., Supporting Differentiated Service Classes: Queue Scheduling Disciplines , Juniper Networks, USA, 2001.

[18] Singh L. and Srivastava R., Design and Implementation of G/G/1 Queuing Model Algorithm for its Applicability in Internet Gateway Server, the International Arab Journal of Information Technology , vol. 5, no. 4, pp. 111- 118, 2008.

[19] Stamoulis A., Sidiropoulos N., and Giannakis G., Time-Varying Fair Queuing Scheduling for Multicode CDMA Based on Dynamic Programming, IEEE Transactions on Wireless Communications , vol. 3, no. 2, pp. 512-523, 2004.

[20] Stoica I., Shenker S., and Zhang H., Core- Stateless Fair Queuing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks, IEEE/ACM Transaction on Networking , vol. 11, no. 1, pp. 33-46, 2003.

[21] Tsao S., Lai Y., Tsao L., and Lin Y., On Applying Fair Queuing Discipline to Schedule Requests at Access Gateway for Downlink Differential Qos, the International Journal of Computer and Telecommunications Networking , vol. 52, no. 18, pp. 3392-3404, 2008.

[22] Willig A., A Short Introduction to Queueing Theory, avalible at: http://www.cs.ucf.edu/ ~lboloni/Teaching/EEL6785_Fall2010/slides/Qu eueingTheory.pdf, last visited 1999. Enhanced Core Stateless Fair Queuing with Multiple Queue Priority Scheduler 167 Nandhini Sivasubramaniam has obtained her M.Sc in mathematics and Master of Philosophy in mathematics. She is currently working as a senior lecturer in the Department of Computer Science at Garden City College of Science and Management Studies, India. She has presented pape rs in national conferences. Her area of interest inclu des queueing theory, computer networks, graph theory an d operations research. Palaniammal Senniappan received her PhD degree in applied mathematics from PSG college of Technology, Coimbatore in 2006. She is currently working as a professor and head in the Department of Science and Humanities at VLB Janakiammal College of Engineering and Technology, India. She has published 57 papers in national/ international journals/ conferences. Her areas of interest are queueing theory, data mining and networking. Under her guidance 9 scholars are pursuing their PhD and 2 M.Phil scholars has been completed. She has also authored 9 books in mathematics for B.E/B.Tech students and 2 of her books Probability and Queueing Theory , Probability and Random Processes are published in Prentice Hall of India.