Scheduling algorithm for real-time burst traffic using dynamic weighted round robin
Taeck-Geun Kwon, Sook-Hyang Lee, June-Kyung Rho · 2002
In this paper, we propose a new scheduling algorithm, called the dynamic weighted round robin (DWRR) scheduling discipline, which is suitable for real-time variable bit rate (rtVBR) service as well as other services such as constant bit rate (CBR), non real-time VBR (nrtVBR), available bit rate (ABR) services in a high-speed network. We employ dynamic weight to serve a queue associated with active and busy connection with strict delay and bandwidth requirements. This adaptive scheduling algorithm enables a network to provide multimedia service characterized by integrated and burst traffic. We finally compare our new algorithm with existing one in terms of fairness and Quality of Service (QoS) guarantee by simulation study.