Delay Analysis of Scheduling Algorithms for Real-Time Traffic in Packet Switched Networks

Abstract

The packet switched data network like Internet, which has traditionally supported throughput sensitive applications such as email and file transfer, is increasingly supporting delay-sensitive multimedia applications such as interactive video. These delay-sensitive applications would often rather sacrifice some throughput for lower delay. Unfortunately, the current packet switched network does not offer choices, but instead provides monolithic best-effort service to all applications. This paper evaluates CBQ (Class Based Queuing), CEDF (Coordinated Earliest Deadline First), WSDRR (Weighted Switch Deficit Round Robin) and RED-Boston scheduling schemes that is sensitive to Quality of Service (QoS) expectations for variety of applications and propose improvements.