{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:38:11Z","timestamp":1755218291903,"version":"3.43.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Systems"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1015890105072","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T20:08:46Z","timestamp":1041106126000},"page":"241-270","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling Multiclass Packet Streams to Minimize Weighted Loss"],"prefix":"10.1007","volume":"41","author":[{"given":"Robert L.","family":"Givan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin K.P.","family":"Chong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyeong Soo","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5088501_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/285243.285275","volume":"28","author":"S. Bajaj","year":"1998","unstructured":"S. Bajaj, L. Breslau and S. Shenker, Uniform versus priority dropping for layered video, ACM Comput. Comm. Rev. 28 (1998) 131-143.","journal-title":"ACM Comput. Comm. Rev."},{"key":"5088501_CR2","unstructured":"L. Breslau, Example traffic trace for NS, http:\/\/www.research.att.com\/breslau\/ vint\/trace.html."},{"key":"5088501_CR3","unstructured":"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."},{"issue":"6","key":"5088501_CR4","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1109\/90.266050","volume":"1","author":"R. Cocchi","year":"1993","unstructured":"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.","journal-title":"IEEE\/ACM Trans. Net."},{"key":"5088501_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA, 1990)."},{"key":"5088501_CR6","first-page":"3","volume":"1","author":"A. Demers","year":"1990","unstructured":"A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queuing algorithm, J. Internetworking: Research Experience 1 (1990) 3-26.","journal-title":"J. Internetworking: Research Experience"},{"key":"5088501_CR7","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/047120644X.ch15","volume-title":"Self-similar Network Traffic and Performance Evaluation","author":"A. Feldmann","year":"2000","unstructured":"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."},{"key":"5088501_CR8","unstructured":"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."},{"issue":"4","key":"5088501_CR9","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/90.793002","volume":"7","author":"S. Floyd","year":"1999","unstructured":"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.","journal-title":"IEEE\/ACM Trans. Net."},{"issue":"4","key":"5088501_CR10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/90.413212","volume":"3","author":"S. Floyd","year":"1995","unstructured":"S. Floyd and V. Jacobson, Link-sharing and resource management models for packet networks, IEEE\/ACM Trans. Net. 3(4) (1995) 365-386.","journal-title":"IEEE\/ACM Trans. Net."},{"key":"5088501_CR11","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/ISIT.1998.708761"},{"key":"5088501_CR12","unstructured":"B. Hajek and P. Seri, Lex-optimal multiclass scheduling with deadlines, submitted toMath. Oper. Res."},{"key":"5088501_CR13","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler, Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)."},{"key":"5088501_CR14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"E.L. Lawler","year":"1969","unstructured":"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.","journal-title":"Managm. Sci."},{"key":"5088501_CR15","unstructured":"T.L. Ling and N. Shroff, Scheduling real-time traffic in ATM network, in: Proc. IEEE INFOCOM, 1996, pp. 198-205."},{"issue":"10","key":"5088501_CR16","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1016\/0305-0548(94)00090-U","volume":"22","author":"J.M. Peha","year":"1995","unstructured":"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.","journal-title":"J. Comput. Oper. Res."},{"key":"5088501_CR17","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/GLOCOM.1990.116473"},{"key":"5088501_CR18","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S. Sahni","year":"1976","unstructured":"S. Sahni, Algorithms for scheduling independent tasks, J. ACM 23 (1976) 116-127.","journal-title":"J. ACM"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015890105072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015890105072\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015890105072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T04:41:44Z","timestamp":1754455304000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015890105072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["5088501"],"URL":"https:\/\/doi.org\/10.1023\/a:1015890105072","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"type":"print","value":"0257-0130"},{"type":"electronic","value":"1572-9443"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}