A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because it could allow a more efficient use of resources. Deadline-based algorithms can provide powerful QoS provision. However, the cost associated with keeping ordered lists of packets makes them impractical for highperformance networks. In this paper, we explore how to adapt efficiently the Earliest Deadline First family of algorithms to the high-speed networks environments. Thedoi:10.1109/tc.2008.39 fatcat:7gks3zjtl5h5jmxsr5l2jwz3hq