Abstract
We consider the problem of scheduling an arriving sequence of packets at a single server. Associated with each packet is a deadline by which the packet must be scheduled. Each packet belongs to one of a predetermined set of classes, and each class has an associated weight value. The goal is to minimize the total weighted value of the packets that miss their deadlines. We first prove that there is no policy that minimizes this weighted loss for all finite arrival sequences of packets. We then present a class of greedy scheduling policies, called the current-minloss throughput-optimal (CMTO) policies. We characterize all CMTO policies, and provide examples of easily implementable CMTO policies. We compare CMTO policies with a multiclass extension of the earliest-deadline-first (EDF) policy, called EDF+, establishing that a subclass of CMTO policies achieves no more weighted loss than EDF+ for any traffic sequence, and at the same time achieves a substantial weighted-loss advantage over EDF+ for some traffic sequences – this advantage is shown to be arbitrarily close to the maximum possible achievable advantage. We also provide empirical results to quantify the weighted-loss advantage of CMTO policies over EDF+ and the static-priority (SP) policy, showing an advantage exceeding an order of magnitude when serving heavy-tailed aggregations of MPEG traces.
Similar content being viewed by others
References
S. Bajaj, L. Breslau and S. Shenker, Uniform versus priority dropping for layered video, ACM Comput. Comm. Rev. 28 (1998) 131-143.
L. Breslau, Example traffic trace for NS, http://www.research.att.com/breslau/ vint/trace.html.
H.S. Chang, R. Givan and E.K.P. Chong, On-line scheduling via sampling, in: Proc. of the 5th Internat. Conf. on Artificial Intelligence Planning and Scheduling, Colorado, 2000, pp. 62-71.
R. Cocchi, S. Shenker, D. Estrin and L. Zhang, Pricing in computer networks: Motivation, formulation, and example, IEEE/ACM Trans. Net. 1(6) (1993) 614-627.
T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA, 1990).
A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queuing algorithm, J. Internetworking: Research Experience 1 (1990) 3-26.
A. Feldmann, Characteristics of TCP connection arrivals, in: Self-similar Network Traffic and Performance Evaluation, eds. K. Park and W. Willinger (Wiley, New York, 2000) pp. 367-399.
W. Feng, D.D. Kandlur, D. Saha and K.G. Shin, Adaptive packet marking for providing differentiated services in the Internet, in: Proc. of Internat. Conf. on Network Protocols, 1998, pp. 108-117.
S. Floyd and K. Fall, Promoting the use of end-to-end congestion control in the Internet, IEEE/ACM Trans. Net. 7(4) (1999) 458-472.
S. Floyd and V. Jacobson, Link-sharing and resource management models for packet networks, IEEE/ACM Trans. Net. 3(4) (1995) 365-386.
B. Hajek and P. Seri, On causal scheduling of multiclass traffic with deadlines, in: Proc. of IEEE Internat. Symposium on Information Theory, Cambridge, MA, 1998, p. 166.
B. Hajek and P. Seri, Lex-optimal multiclass scheduling with deadlines, submitted toMath. Oper. Res.
E.L. Lawler, Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
E.L. Lawler and J.M. Moore, A functional equation and its application to resource allocation and sequencing problems, Managm. Sci. 16 (1969) 77-84.
T.L. Ling and N. Shroff, Scheduling real-time traffic in ATM network, in: Proc. IEEE INFOCOM, 1996, pp. 198-205.
J.M. Peha, Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time, J. Comput. Oper. Res. 22(10) (1995) 1089-1100.
J.M. Peha and F.A. Tobagi, Evaluating scheduling algorithms for traffic with heterogeneous performance objectives, in: Proc. of IEEE GLOBECOM, 1990, pp. 21-27.
S. Sahni, Algorithms for scheduling independent tasks, J. ACM 23 (1976) 116-127.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Givan, R.L., Chong, E.K. & Chang, H.S. Scheduling Multiclass Packet Streams to Minimize Weighted Loss. Queueing Systems 41, 241–270 (2002). https://doi.org/10.1023/A:1015890105072
Issue Date:
DOI: https://doi.org/10.1023/A:1015890105072