{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:50:56Z","timestamp":1771699856443,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,10,26]],"date-time":"2005-10-26T00:00:00Z","timestamp":1130284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,10,26]]},"DOI":"10.1145\/1095890.1095896","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T17:34:39Z","timestamp":1131384879000},"page":"29-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Group round robin"],"prefix":"10.1145","author":[{"given":"Bogdan","family":"Caprita","sequence":"first","affiliation":[{"name":"Columbia University, New York, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Nieh","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wong Chun","family":"Chan","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"CA","author":"Bennett J.","year":"1996","unstructured":"J. Bennett and H. Zhang , \" WF2Q: Worst-case Fair Weighted Fair Queuing,\" in Proceedings of INFOCOM '96, San Francisco , CA , Mar. 1996 . J. Bennett and H. Zhang, \"WF2Q: Worst-case Fair Weighted Fair Queuing,\" in Proceedings of INFOCOM '96, San Francisco, CA, Mar. 1996."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/248156.248170"},{"key":"e_1_3_2_1_4_1","volume-title":"USENIX","author":"Caprita B.","year":"2005","unstructured":"B. Caprita , W. C. Chan , J. Nieh , C. Stein , and H. Zheng , \" Group-Ratio Round Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems,\" in Proceedings of the 2005 USENIX Annual Technical Conference , USENIX , Anaheim, CA , April 2005 . B. Caprita, W. C. Chan, J. Nieh, C. Stein, and H. Zheng, \"Group-Ratio Round Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems,\" in Proceedings of the 2005 USENIX Annual Technical Conference, USENIX, Anaheim, CA, April 2005."},{"key":"e_1_3_2_1_6_1","volume-title":"NY","author":"Cheung S.","year":"2002","unstructured":"S. Cheung and C. Pencea , \" BSFQ: Bin Sort Fair Queuing,\" in Proceedings of INFOCOM ' 02, New York , NY , June 2002 . S. Cheung and C. Pencea, \"BSFQ: Bin Sort Fair Queuing,\" in Proceedings of INFOCOM ' 02, New York, NY, June 2002."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383076"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.700891"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/75246.75248"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of IEEE INFOCOM '94","author":"Golestani S. J.","year":"1994","unstructured":"S. J. Golestani , \" A Self-Clocked Fair Queuing Scheme for Broadband applications,\" in Proceedings of IEEE INFOCOM '94 , Apr. 1994 . S. J. Golestani, \" A Self-Clocked Fair Queuing Scheme for Broadband applications,\" in Proceedings of IEEE INFOCOM '94, Apr. 1994."},{"key":"e_1_3_2_1_11_1","volume-title":"Apr.","author":"Goyal P.","year":"1995","unstructured":"P. Goyal , S. Lam , and H. Vin , \" Determining End-to-End Delay Bounds in Heterogeneous Networks,\" in Proceedings NOSSDAV , Apr. 1995 . P. Goyal, S. Lam, and H. Vin, \"Determining End-to-End Delay Bounds in Heterogeneous Networks,\" in Proceedings NOSSDAV, Apr. 1995."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.649569"},{"key":"e_1_3_2_1_13_1","volume-title":"Queuing Systems, Volume II: Computer Applications","author":"Kleinrock L.","year":"1976","unstructured":"L. Kleinrock , Queuing Systems, Volume II: Computer Applications . New York : John Wiley & Sons , 1976 . L. Kleinrock, Queuing Systems, Volume II: Computer Applications. New York: John Wiley & Sons, 1976."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.234856"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863983"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/217382.217453"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.664266"},{"key":"e_1_3_2_1_18_1","volume-title":"SPIE Proceedings Series","author":"Stoica I.","year":"1997","unstructured":"I. Stoica , H. Abdel-Wahab , and K. Jeffay , \" On the Duality between Resource Reservation and Proportional Share Resource Allocation,\" in Multimedia Computing and Networking Proceedings , SPIE Proceedings Series , 3020, Feb. 1997 . I. Stoica, H. Abdel-Wahab, and K. Jeffay, \"On the Duality between Resource Reservation and Proportional Share Resource Allocation,\" in Multimedia Computing and Networking Proceedings, SPIE Proceedings Series, 3020, Feb. 1997."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633052"},{"key":"e_1_3_2_1_21_1","volume-title":"FL","author":"Yuan X.","year":"2005","unstructured":"X. Yuan and Z. Duan , \" FRR: a Proportional and Worst-Case Fair Round Robin Scheduler,\" in Proceedings of INFOCOM '05, Miami , FL , Mar. 2005 . X. Yuan and Z. Duan, \"FRR: a Proportional and Worst-Case Fair Round Robin Scheduler,\" in Proceedings of INFOCOM '05, Miami, FL, Mar. 2005."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/103720.103721"}],"event":{"name":"ANCS05: Symposium on Architecture for Networking and Communications Systems 2005","location":"Princeton NJ USA","acronym":"ANCS05","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095890.1095896","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1095890.1095896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:28Z","timestamp":1750262908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095890.1095896"}},"subtitle":["improving the fairness and complexity of packet scheduling"],"short-title":[],"issued":{"date-parts":[[2005,10,26]]},"references-count":19,"alternative-id":["10.1145\/1095890.1095896","10.1145\/1095890"],"URL":"https:\/\/doi.org\/10.1145\/1095890.1095896","relation":{},"subject":[],"published":{"date-parts":[[2005,10,26]]},"assertion":[{"value":"2005-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}