{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:32:48Z","timestamp":1725679968037},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/icccn.2013.6614175","type":"proceedings-article","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T20:14:00Z","timestamp":1383164040000},"page":"1-7","source":"Crossref","is-referenced-by-count":3,"title":["Providing Near-Optimal Fair-Queueing Guarantees at Round-Robin Amortized Cost"],"prefix":"10.1109","author":[{"given":"Paolo","family":"Valente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Analysis of Fair Queueing Schedulers in Real Systems","year":"0","author":"valente","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.176"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/90.502236"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/49.772449"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.886287"},{"key":"14","first-page":"9","article-title":"Netmap: A novel framework for fast packet i\/o","author":"rizzo","year":"0","journal-title":"Proceedings of the 2012 USENIX Conference on Annual Technical Conference (Berkeley CA USA 2012) USENIX ATC'12"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.833131"},{"journal-title":"Computer Networks - A Systems Approach","year":"2010","author":"peterson","key":"12"},{"year":"0","key":"3"},{"year":"0","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2033059"},{"year":"0","key":"1"},{"key":"7","article-title":"QFQ: Efficient Packet Scheduling with Tight Bandwidth Distribution Guarantees","author":"checconi","year":"0","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"6","first-page":"120","article-title":"WF2 Q: Worst-case fair weighted fair queueing","author":"bennett","year":"0","journal-title":"Proceedings of IEEE INFOCOM '96 (March 1996)"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/90.649568"},{"year":"0","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.133"},{"key":"8","first-page":"211","article-title":"SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks","author":"guo","year":"2001","journal-title":"Proceedings of ACM SIGCOMM 2001"}],"event":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN 2013)","start":{"date-parts":[[2013,7,30]]},"location":"Nassau, Bahamas","end":{"date-parts":[[2013,8,2]]}},"container-title":["2013 22nd International Conference on Computer Communication and Networks (ICCCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6603810\/6614072\/06614175.pdf?arnumber=6614175","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T18:59:12Z","timestamp":1490209152000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6614175\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icccn.2013.6614175","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}