Enhanced Core Stateless Fair Queuing with Multiple Queue Priority Scheduler

Nandhini Sivasubramaniam1 and Palaniammal Senniappan2
1Department of Computer Science, Garden City College of Science and Management, India
2Department of Science and Humanities, VLB Janakiammal College of Engineering and Technology, India

Abstract: The Core Stateless Fair Queuing (CSFQ) is distributed approach of fair queuing. The limitations include its inability to estimate fairness during large traffic flows which are short and bursty (VoIP or video) 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 scheduler. 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 higher priority else lower priority.  In core router, for higher priority flows the multiple queue fair queuing is applied that allows a flow to utilize multiple queues to transmit the packets. In case of lower priority, the normal max-min fairness criterion of CSFQ is applied to perform probabilistic packet dropping. By simulation results, we show that this technique improves the throughput of real time flows by reducing the packet loss and delay.

Keywords: CSFQ, quality of service, multiple queue fair queuing, priority scheduler.

 

Received November 21, 2011; accepted December 18, 2012

  

Full Text