{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:30:14Z","timestamp":1738387814486,"version":"3.35.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1007\/bf02948980","type":"journal-article","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T00:51:57Z","timestamp":1221267117000},"page":"315-328","source":"Crossref","is-referenced-by-count":0,"title":["Approximate sorting of packet-scheduling in high-speed networks"],"prefix":"10.1007","volume":"16","author":[{"given":"Youcheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengsheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Zha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingli","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"BF02948980_CR1","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/48014.48019","volume":"35","author":"S Panwar","year":"1988","unstructured":"Panwar S, Towsley D, Wolf J. Optimal scheduling policies for a class of queues with customer deadlines to the beginning of services.Journal of ACM, 1988, 35(4): 832\u2013844.","journal-title":"Journal of ACM"},{"issue":"6","key":"BF02948980_CR2","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/90.556345","volume":"4","author":"J Liebeherr","year":"1996","unstructured":"Liebeherr J, Wrege D E, Ferrari D. Exact admission control in networks with bounded delay service.IEEE\/ACM Transactions on Networking, December, 1996, 4(6): 885\u2013901.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"BF02948980_CR3","doi-asserted-by":"crossref","unstructured":"Zhang Lixia. Virtual clock: A new traffic control algorithm for packet switching networks. InProceedings of ACM SIGCOMM\u201990, August, 1990, pp.19\u201329.","DOI":"10.1145\/99517.99525"},{"key":"BF02948980_CR4","unstructured":"Goyal P, Vin H M, Cheng H. Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks. InProceedings of ACM SIGCOMM\u201996, August, 1996, pp.157\u2013168. Another version is published inIEEE\/ACM Transactions on Networking, October, 1997, 5(5): 690\u2013704."},{"key":"BF02948980_CR5","doi-asserted-by":"crossref","unstructured":"Golestani S J. A Self-clocked fair queuing scheme for broadband application. InProceedings of IEEE INFOCOM\u201994, April, 1994, pp.636\u2013646.","DOI":"10.1109\/INFCOM.1994.337677"},{"issue":"5","key":"BF02948980_CR6","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/90.731196","volume":"6","author":"D Stiliadis","year":"1998","unstructured":"Stiliadis D, Varma A. Latency rate servers: A general model for analysis of traffic scheduling algorithms.IEEE\/ACM Transactions on Networking, October, 1998, 6(5): 611\u2013624.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"4","key":"BF02948980_CR7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.3233\/JHS-1994-3405","volume":"3","author":"H Zhang","year":"1994","unstructured":"Zhang H, Ferrari D. Rate-controlled service disciplines.Journal of High Speed Networks, 1994, 3 (4): 389\u2013412.","journal-title":"Journal of High Speed Networks"},{"issue":"4","key":"BF02948980_CR8","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/90.532860","volume":"4","author":"L Georgiadis","year":"1996","unstructured":"Georgiadis L, Guerin R, Peris V, Sivarajan H N. Efficient network QoS provisioning based on per node traffic shaping.IEEE\/ACM Transactions on Networking, August, 1996, 4(4): 482\u2013501.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"BF02948980_CR9","doi-asserted-by":"crossref","unstructured":"Shreedhar M, Varghese G. Efficient fair queuing using deficit round robin. InProceedings of ACM SIGCOMM\u201995, 1995, pp.231\u2013242. Also published inIEEE Transactions on Networking, June, 1996, 4(3): 375\u2013385.","DOI":"10.1109\/90.502236"},{"key":"BF02948980_CR10","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1109\/49.105173","volume":"9","author":"M Katvenis","year":"1991","unstructured":"Katvenis M, Sidiropoulos S, Courcoubetis C. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip.IEEE Journal on Selected Areas in Communications, 1991, 9: 1265\u20131279.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"BF02948980_CR11","doi-asserted-by":"crossref","unstructured":"Haldar S, Subramanian D K. Fairness in processor scheduling in time sharing systems. InProceedings of the 13th ACM Symposium on Operating System Principles, October, 1991, pp.4\u201318.","DOI":"10.1145\/122140.122141"},{"issue":"2","key":"BF02948980_CR12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/90.664266","volume":"6","author":"D Stiliadis","year":"1998","unstructured":"Stiliadis D, Varma A. Efficient fair queuing algorithms for packet-switched networks.IEEE\/ACM Transactions on Networking, April, 1998, 6(2): 175\u2013185.","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948980.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02948980\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:49:34Z","timestamp":1738363774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02948980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["BF02948980"],"URL":"https:\/\/doi.org\/10.1007\/bf02948980","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}