{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T04:10:11Z","timestamp":1777349411342,"version":"3.51.4"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icccn.2002.1043123","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T23:36:53Z","timestamp":1056584213000},"page":"548-553","source":"Crossref","is-referenced-by-count":17,"title":["On the latency bound of deficit round robin"],"prefix":"10.1109","author":[{"given":"S.S.","family":"Kanhere","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Sethu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/INFCOM.1996.497885","article-title":"WF2Q: Worst-case fair weighted fair queueing","author":"bennett","year":"1996","journal-title":"Proceedings of IEEE Infocom"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/90.649569"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/65.642356"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/71.993210"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/49.772455"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/90.502236"},{"key":"ref8","author":"stiliadis","year":"1996","journal-title":"Traffic scheduling in packet-switched networks Analysis design and implementation"},{"key":"ref7","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":"1996","journal-title":"IEEE Transactions on Networking"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1994.337677"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00009-9"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/75247.75248","article-title":"Design and analysis of a fair queuing algorithm","author":"demers","year":"1989","journal-title":"Proceedings of ACM SIGCOMM"}],"event":{"name":"Eleventh International Conference on Computer Communications and Networks","location":"Miami, FL, USA","acronym":"ICCCN-02"},"container-title":["Proceedings. Eleventh International Conference on Computer Communications and Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8081\/22349\/01043123.pdf?arnumber=1043123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T23:48:26Z","timestamp":1519516106000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1043123\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/icccn.2002.1043123","relation":{},"subject":[]}}