A scheduling algorithm for controlling of service rate and burst
Mahmoud Daneshvar Farzanegan, Hossein Saidi, Mehdi Mahdavi · 2012
Scheduling algorithms have significant role in providing of the quality of service (QoS) in data networks. Mostly, service rate is considered as an isolating parameter in the scheduling algorithms. However, when a delay-sensitive and bursty session such as video streaming or interactive gaming is scheduled by these rate-based servers, the imposed delay may be much more than an acceptable threshold which is required for QoS provisioning. In this paper, we propose a fluid flow scheduling algorithm which applies burstiness as an additional isolating parameter. We assume that the arrival burstiness constraint is leaky bucket. Our proposed scheduling algorithm attempts to provide a service discipline similar to the arrival constraint. In our algorithm, the weight of each session and also service rate may increase when a burst arrives. Therefore, the scheduler can isolate some bursty sessions to receive much more amount of service in burst condition. The evaluation of the proposed algorithm is carried out by calculating packet delay statistics through a simulation strategy where various kinds of traffic are scheduled by the proposed algorithm.