{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:58:42Z","timestamp":1742403522683,"version":"3.30.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0140-3664(02)00009-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T14:29:16Z","timestamp":1034605756000},"page":"1315-1322","source":"Crossref","is-referenced-by-count":12,"title":["Low-latency guaranteed-rate scheduling using Elastic Round Robin"],"prefix":"10.1016","volume":"25","author":[{"given":"Salil S.","family":"Kanhere","sequence":"first","affiliation":[]},{"given":"Harish","family":"Sethu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1997","series-title":"An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network","author":"Keshav","key":"10.1016\/S0140-3664(02)00009-9_BIB1"},{"key":"10.1016\/S0140-3664(02)00009-9_BIB2","doi-asserted-by":"crossref","unstructured":"A. Demers, S. Keshav, S. Shenker, Design and analysis of a fair queuing algorithm, Proceedings of ACM SIGCOMM, Austin, 1989, pp. 1\u201312.","DOI":"10.1145\/75247.75248"},{"key":"10.1016\/S0140-3664(02)00009-9_BIB3","doi-asserted-by":"crossref","unstructured":"A.K. Parekh, R.G. Gallager, A generalized processor sharing approach to flow control the single node case, Proceedings of IEEE INFOCOM, Florence, Italy, 1992, pp. 915\u2013924.","DOI":"10.1109\/INFCOM.1992.263509"},{"key":"10.1016\/S0140-3664(02)00009-9_BIB4","doi-asserted-by":"crossref","unstructured":"S.J. Golestani, A self-clocked fair queuing scheme for broadband applications, Proceedings of IEEE INFOCOM, Toronto, Canada, 1994, pp. 636\u2013646.","DOI":"10.1109\/INFCOM.1994.337677"},{"issue":"5","key":"10.1016\/S0140-3664(02)00009-9_BIB5","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/90.649569","article-title":"Start-time fair queuing: a scheduling algorithm for integrated services packet switched networks","volume":"5","author":"Goyal","year":"1997","journal-title":"IEEE Transactions of Networking"},{"issue":"2","key":"10.1016\/S0140-3664(02)00009-9_BIB6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/90.664266","article-title":"Efficient fair queuing algorithms for packet-switched networks","volume":"6","author":"Stiliadis","year":"1998","journal-title":"IEEE Transcations on Networking"},{"key":"10.1016\/S0140-3664(02)00009-9_BIB7","doi-asserted-by":"crossref","unstructured":"J.C.R. Bennett, H. Zhang, WF2Q: Worst-case fair weighted fair queuing, Proceedings of IEEE INFOCOM, San Francisco, CA, 1996, pp. 120\u2013128.","DOI":"10.1109\/INFCOM.1996.497885"},{"issue":"3","key":"10.1016\/S0140-3664(02)00009-9_BIB8","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1109\/90.502236","article-title":"Efficient fair queuing using deficit round-robin","volume":"4","author":"Shreedhar","year":"1996","journal-title":"IEEE Transactions on Networking"},{"key":"10.1016\/S0140-3664(02)00009-9_BIB9","doi-asserted-by":"crossref","unstructured":"S.S. Kanhere, A. Parekh, H. Sethu, Fair and efficient packet scheduling in wormhole net works, Proceedings of the International Parallel and Distributed Processing Symposium, Cancun, Mexico, 2000, pp. 623\u2013631.","DOI":"10.1109\/IPDPS.2000.846044"},{"issue":"5","key":"10.1016\/S0140-3664(02)00009-9_BIB10","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/90.731196","article-title":"Latency-rate servers: a general model for analysis of traffic scheduling algorithms","volume":"6","author":"Stiliadis","year":"1998","journal-title":"IEEE Transactions on Net-working"},{"key":"10.1016\/S0140-3664(02)00009-9_BIB11","unstructured":"S. Floyd, Notes on class-based-queuing and guaranteed service, http:\/\/www.aciri.org\/floyd\/cbq.html."},{"issue":"4","key":"10.1016\/S0140-3664(02)00009-9_BIB12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/90.413212","article-title":"Link-sharing and resource management models for packet networks","volume":"3","author":"Floyd","year":"1995","journal-title":"IEEE Transactions on Networking"},{"key":"10.1016\/S0140-3664(02)00009-9_BIB13","doi-asserted-by":"crossref","unstructured":"G.P.H. Adiseshu, G. Varghese, A reliable and scalable striping protocol, Proceedings of ACM SIGCOMM, Palo Alto, CA, 1996, pp. 131\u2013141.","DOI":"10.1145\/248156.248169"},{"key":"10.1016\/S0140-3664(02)00009-9_BIB14","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/65.642356","article-title":"Widearea internet traffic patterns and characteristic","author":"Thompson","year":"1997","journal-title":"IEEE Network"},{"issue":"6","key":"10.1016\/S0140-3664(02)00009-9_BIB15","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1109\/49.772455","article-title":"Performance issues in vc-merge capable switches for multiprotocol label switching","volume":"17","author":"Widjaja","year":"1999","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/S0140-3664(02)00009-9_BIB16","doi-asserted-by":"crossref","unstructured":"L. Zhang, Virtual clock: a new traffic control algorithm for packet switching networks, Proceedings of ACM SIGCOMM, Philadelphia, PA, 1990, pp. 19-29.","DOI":"10.1145\/99508.99525"},{"key":"10.1016\/S0140-3664(02)00009-9_BIB17","doi-asserted-by":"crossref","unstructured":"D. Stiliadis, Traffic scheduling in packet-switched networks: analysis, design, and implementation, PhD thesis, University of California, Santa Cruz, June 1996.","DOI":"10.1145\/233008.233030"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402000099?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402000099?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T02:46:03Z","timestamp":1733280363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366402000099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":17,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0140366402000099"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(02)00009-9","relation":{},"ISSN":["0140-3664"],"issn-type":[{"type":"print","value":"0140-3664"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}