Mobility

Deadline Guaranteed Packet Scheduling for Overloaded Traffic in Input-Queued Switches

Download Now Free registration required

Executive Summary

Many applications need to solve the deadline guaranteed packet scheduling problem. However, it is a very difficult problem if three or more deadlines are present in a set of packets to be scheduled. The traditional approach to dealing with this problem is to use EDF (Earliest Deadline First) or similar methods. Recently, a non-EDF based algorithm was proposed that constantly produces a higher throughput than EDF-based algorithms by repeatedly finding an optimal scheduling for two classes. However, this new method requires the two classes be non-overloaded, which greatly restricts its applications.

  • Format: PDF
  • Size: 1064.96 KB