{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:51:59Z","timestamp":1729633919370,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1109\/icc.2010.5502015","type":"proceedings-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T10:22:30Z","timestamp":1278930150000},"page":"1-5","source":"Crossref","is-referenced-by-count":6,"title":["Two-Stage Fair Queuing Using Budget Round-Robin"],"prefix":"10.1109","author":[{"given":"D.","family":"Lin","sequence":"first","affiliation":[]},{"given":"M.","family":"Hamdi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Router mechanisms to support end-to-end congestion control","author":"floyd","year":"1997","journal-title":"LBL Technical Report"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2005.1383435"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/285243.285273"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923720"},{"journal-title":"Scaling issues on Internet networks","year":"2001","author":"st arnaud","key":"ref14"},{"journal-title":"NLANR's PMA Project","year":"2004","key":"ref15"},{"key":"ref16","article-title":"Building Packet Buffers with Interleaved Memories","author":"gireesh","year":"2005","journal-title":"HPSR'05"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2006.1709682"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/103720.103721"},{"key":"ref3","first-page":"113","article-title":"Stochastic fairness queueing","volume":"2","author":"mckenney","year":"1991","journal-title":"Internetworking Research and Experience"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/90.413212"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1994.337677"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1996.497885"},{"key":"ref7","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":"ref2","article-title":"How fair is fair queueing?","author":"greenberg","year":"1990","journal-title":"Proc Performance 90"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/75246.75248"},{"key":"ref9","first-page":"127","article-title":"Dynamics of random early detection","author":"lin","year":"1997","journal-title":"Proceedings of ACM SIGCOMM'97"}],"event":{"name":"ICC 2010 - 2010 IEEE International Conference on Communications","start":{"date-parts":[[2010,5,23]]},"location":"Cape Town, South Africa","end":{"date-parts":[[2010,5,27]]}},"container-title":["2010 IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5497983\/5501741\/05502015.pdf?arnumber=5502015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T06:43:14Z","timestamp":1497854594000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5502015\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icc.2010.5502015","relation":{},"subject":[],"published":{"date-parts":[[2010,5]]}}}