Scheduling Mixed Traffic under Earliest-Deadline-First Algorithm

摘要

Recently, real-time packet schedulers based on Earliest Deadline First (EDF) policy have been extensively studied to support end-to-end bounded delay for real-time traffic. However, the packet scheduler could not guarantee the QoS requirements of real-time traffic since it receives a number of non-real-time traffic for the purpose of management and control. In this paper, we study a packet scheduling scheme servicing non-real-time traffic using the available time of link (i.e. slack time). Proposed scheme assigns the deadline to non-real-time packets on-line and services them under EDF policy. Since proposed scheme services the non-real-time traffic when the link bandwidth is not used, it can guarantee the schedulability of real-time flows.