Analysis of BSCFQ: A Modified Version of SCFQ to Support Bursty Traffic

The provisioning of quality of service in networks requires a proper scheduling algorithm. The nature of network traffic, especially real-time multimedia applications, is bursty, thus in addition to the service rate (which is commonly used to isolate sessions' service), other parameters should be involved. In this paper we analyze our proposed scheduling algorithm [Burst Service SCFQ, BSCFQ (Daneshvar et al. in Int J Wirel Mobile Netw 5, 2013)] which attempts to provide a balance between bursty and non-bursty (smooth) traffics. BSCFQ is an improvement of Self-Clock Fair Queueing (SCFQ), a well-known packet scheduling algorithm, in order to be able to compensate for an adjustable amount of missed service to each session. BSCFQ is evaluated by calculating the fairness index, burst service which is defined by the authors and delay bound. Our improvement in the SCFQ does not necessitate any additional computation as regards the implement algorithm.