Skip navigation
Skip navigation

Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches

Shen, Xiaojun; Lou, Jianyu; Liang, Weifa; Luo, Junzhou


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]

CollectionsANU Research Publications
Date published: 2008
Type: Journal article
Source: Theoretical Computer Science
DOI: 10.1016/j.tcs.2008.09.013


File Description SizeFormat Image
01_Shen_Deadline_guaranteed_packet_2008.pdf812.54 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator