A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
Greedy Packet Scheduling
SIAM journal on computing (Print)
A b s t r a c t Scheduling packets to be forwarded over a link is an important subtask of the routing process both in paxalhl computing and in communication networks. This paper investigates the simple class of greedy scheduling algorithms, namely, algorithms that always forward a packet if they can. It is first proved that for various "natural" classes of routes, the time required to complete the transmission of a set of packets is bounded by the sum of the number of packets and the maximaldoi:10.1137/s0097539791217695 fatcat:xr5azrvl2va6pisudqibsclfsi