Improving SCFQ to Support Bursty Traffic
Mahmoud Daneshvar Farzanegan, Hossein Saidi, Mehdi Mahdavi · International Journal of Wireless & Mobile Networks · 2013
Quality of Service (QoS) provisioning in networks requires proper scheduling algorithm.Internet traffic, especially real-time multimedia applications, is bursty in nature .Hence, in addition to the service rate which is commonly used to isolate service of sessions, other parameters should be involved.In this paper a scheduling algorithm is proposed that attempts to provide a balance between bursty and non-bursty (smooth) traffic.We improve thewell-known packet scheduling algorithm, SCFQ.Our proposed algorithm is proficient to compensate an adjustable amount of missed service to each session.The average delay of the proposed algorithm is evaluated by simulation.An important advantage of our algorithm is that byselecting correct parameter setting for each session, the average delay of a bursty session can be reduced.Furthermore, compared to SCFQ our proposed algorithm does not necessitate any additional computation.