{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:39:35Z","timestamp":1729669175457,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lcn.2002.1181824","type":"proceedings-article","created":{"date-parts":[[2003,8,27]],"date-time":"2003-08-27T11:03:45Z","timestamp":1061982225000},"page":"508-517","source":"Crossref","is-referenced-by-count":4,"title":["On the latency bound of pre-order 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":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/90.502236"},{"key":"ref11","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"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/90.664266"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/65.642356"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/S1389-1286(00)00172-9"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/49.772455"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/99517.99525"},{"key":"ref4","first-page":"636","article-title":"A self-clocked fair queuing scheme for broadband applications","author":"golestani","year":"1994","journal-title":"Proceedings of IEEE INFO-COM"},{"year":"1996","author":"stiliadis","article-title":"Trafffic Scheduling in Packet-Switched Networks: Analysis, Design and Implementation","key":"ref3"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1016\/S0140-3664(02)00009-9"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/HPSR.2001.923594"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/71.993210"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/ICCCN.2002.1043123"},{"key":"ref2","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 SIG-COMM"},{"key":"ref1","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":"ref9","first-page":"915","article-title":"A generalized processor sharing approach to flow control-the single node case","author":"parekh","year":"1992","journal-title":"Proceedings of IEEE Infocom"}],"event":{"acronym":"LCN-02","name":"LCN 2002. 27th Annual IEEE Conference on Local Computer Networks","location":"Tampa, FL, USA"},"container-title":["27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8410\/26516\/01181824.pdf?arnumber=1181824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:08:54Z","timestamp":1497557334000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181824\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/lcn.2002.1181824","relation":{},"subject":[]}}