Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
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....[Show more]
|Collections||ANU Research Publications|
|Source:||Theoretical Computer Science|
|01_Shen_Deadline_guaranteed_packet_2008.pdf||812.54 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.