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. For example, the QoS guarantee may be defined for a delay measure in the form of
queue length Qi, i=1, 2, . . . N, and an allowed
queue length violation probability δi. In such an embodiment, the QoS requirement is specified by P(Qi>Hi)≦δi, and the weights αi in the set of positive weights α1, α2, . . . , αN may be given by αi=−Hi / log δi, where Hi represents an upper bound on the length of the
queue.