{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:38:47Z","timestamp":1725511127469},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,11]]},"DOI":"10.1109\/icon.2007.4444108","type":"proceedings-article","created":{"date-parts":[[2008,1,29]],"date-time":"2008-01-29T18:54:22Z","timestamp":1201632862000},"page":"330-335","source":"Crossref","is-referenced-by-count":1,"title":["Last-Backlogged First-Served Deficit Round Robin (LBFS-DRR) Packet Scheduling Algorithm"],"prefix":"10.1109","author":[{"given":"Dessislava","family":"Nikolova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Blondia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1243401.1243405"},{"key":"ref11","article-title":"A relaible and scalable striping protocol","author":"adisshu","year":"1996","journal-title":"Proc ACM Sigcomm"},{"key":"ref12","article-title":"Evaluation of surplus round robin scheduling algorithm","author":"nikolova","year":"2006","journal-title":"Proc SPECTS'06"},{"journal-title":"Traffic scheduling in packet-switched networks Analysis design and implementation","year":"1996","author":"stiliadis","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2002.1043123"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.833131"},{"journal-title":"OMNeT++ simulator","year":"0","key":"ref16"},{"key":"ref17","article-title":"The war between mice and elephants","author":"guo","year":"2001","journal-title":"Proc ICNP 2001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/65.642356"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.1264809"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.886287"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00172-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383076"},{"key":"ref8","article-title":"Implicit service differentiation using deficit round robin","author":"kortebi","year":"2005","journal-title":"Proc ITC"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/71.993210"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1145\/217382.217453","article-title":"Efficient fair queuing using deficit round robin","author":"shreedhar","year":"1995","journal-title":"Proc SIGCOMM'95"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/90.649568"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/1095890.1095912","article-title":"Minimizing the overhead in implementing flow-aware networking","author":"kortebi","year":"2005","journal-title":"2005 Symposium on Architectures for Networking and Communications Systems (ANCS) ANCS"}],"event":{"name":"2007 15th IEEE International Conference on Networks","start":{"date-parts":[[2007,11,19]]},"location":"Adelaide, Australia","end":{"date-parts":[[2007,11,21]]}},"container-title":["2007 15th IEEE International Conference on Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4444030\/4444031\/04444108.pdf?arnumber=4444108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T23:33:44Z","timestamp":1497742424000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4444108\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icon.2007.4444108","relation":{},"ISSN":["1556-6463"],"issn-type":[{"type":"print","value":"1556-6463"}],"subject":[],"published":{"date-parts":[[2007,11]]}}}