Abstract: Packets are scheduled for transmission over a communication link in a network, using a Largest Weighted Delay First (LWDF) scheduling policy. A delay measure Wi, i=1, 2, . . . N, is computed for each of N packets, each associated with a corresponding one of N data flows and located in a head position in a corresponding one of N data flow queues. The computed delay measures are then weighted using a set of positive weights ?1, ?2, . . . , ?N. The packet having the largest weighted delay Wi/?i associated therewith is then selected for transmission. In an embodiment configured to meet a quality of service (QoS) requirement specified in terms of a deadline Ti and an allowed deadline violation probability ?i, e.g., a requirement specified by P(Wi>Ti)??i, the weights ?i in the set of positive weights ?1, ?2, . . . , ?N may be given by ?i=?Ti/log ?i. The invention can also be used to meet other types of QoS requirements, including, e.g., requirements based on packet loss probabilities.

Abstract: Packets are scheduled for transmission over a communication link in a network, using a Largest Weighted Delay First (LWDF) scheduling policy. A delay measure Wi, i=1, 2, . . . N, is computed for each of N packets, each associated with a corresponding one of N data flows and located in a head position in a corresponding one of N data flow queues. The computed delay measures are then weighted using a set of positive weights &agr;1, &agr;2, . . . , &agr;N. The packet having the largest weighted delay Wi/&agr;i associated therewith is then selected for transmission. In an embodiment configured to meet a quality of service (QoS) requirement specified in terms of a deadline Ti and an allowed deadline violation probability &dgr;i, e.g., a requirement specified by P(Wi>Ti)≦&dgr;i, the weights &agr;i in the set of positive weights &agr;1, &agr;2, . . . , &agr;N may be given by &agr;i=−Ti/log &dgr;i. The invention can also be used to meet other types of QoS requirements, including, e.g.