Academy & Industry Research Collaboration Center
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. The authors improve the well-known packet scheduling algorithm, SCFQ. Their proposed algorithm is proficient to compensate an adjustable amount of missed service to each session.