The Earliest Deadline First Scheduling with Active Buffer Management for Real-Time Traffic in the Internet

Abstract

We study the problem of QoS guarantee for differentiated services. A two-level hierarchical scheduling framework is deployed for the separation of the QoS metrics. Due to the desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling is adopted to provide the in-class scheduling for the time-sensitive traffic. We propose to employ an EDF scheduler combined with an active buffer management scheme (CHOKe) to improve the fairness of resource allocation and to maintain a good delay performance for all real-time applications. Simulation results showthat the proposed scheme can achieve a better delay performance and make a more fair bandwidth allocation between the real-time TCP and UDP connections than the First Come First Serve (FCFS) scheduling with the Drop-Tail buffer management which is commonly deployed in the traditional IP router.KeywordsEarliest Deadline FirstFairness IndexRandom Early DetectionActive Queue ManagementFirst Come First ServeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.