W e distinguish between four types of service that may be provided to real-time trafic b y packet-switched networks, ranging from "need-blind" and "need-based best-effort'' t o "guaranteed throughput" and "bounded delay jitter" services. W e evaluate a number of scheduling policies that offer need-based, best-effort service. W e introduce h o p -l a d y (HL) scheduling which is based on the time remaining until the packet must reach its destination as well as the number of hops separating it from the destination. H L scheduling is evaluated through simulation and has been implemented within a BSD-based kernel and tested on the DARTnet network. The results indicate that H L scheduling tends t o equalize delays between calls with large and small number of hops as compared to a FIFO dzscipline, reducing the 99.9% percentile of delay and the fraction of late packets. W e compare H L scheduling to the FIFO+ discipline suggested b y Clark et al.., and $nd that their delay properties are similar. Other disciplines, such as minimum laxity or transit priority, may actually do more harm than good.