{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:44:38Z","timestamp":1772163878613,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,30]],"date-time":"2004-08-30T00:00:00Z","timestamp":1093824000000},"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":[[2004,8,30]]},"DOI":"10.1145\/1015467.1015496","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T13:39:48Z","timestamp":1097156388000},"page":"257-268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Work-conserving distributed schedulers for Terabit routers"],"prefix":"10.1145","author":[{"given":"Prashanth","family":"Pappu","sequence":"first","affiliation":[{"name":"Washington University, St. Louis, MO"}]},{"given":"Jonathan","family":"Turner","sequence":"additional","affiliation":[{"name":"Washington University, St. Louis, MO"}]},{"given":"Ken","family":"Wong","sequence":"additional","affiliation":[{"name":"Washington University, St. Louis, MO"}]}],"member":"320","published-online":{"date-parts":[[2004,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Theory, Applications and Algorithms","author":"Ahuja R.","year":"1993","unstructured":"Ahuja , R. , T. Magnanti and J. Orlin . Network Flows , Theory, Applications and Algorithms . Prentice-Hall , 1993 . Ahuja, R., T. Magnanti and J. Orlin. Network Flows, Theory, Applications and Algorithms. Prentice-Hall, 1993."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/161541.161736"},{"key":"e_1_3_2_1_3_1","unstructured":"Bianchi G. and J. Turner. \"Improved Queueing Analysis of Shared Buffer Switching Networks \" Proceedings of Infocom 3\/93.  Bianchi G. and J. Turner. \"Improved Queueing Analysis of Shared Buffer Switching Networks \" Proceedings of Infocom 3\/93."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(01)00427-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.772430"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863978"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.772435"},{"key":"e_1_3_2_1_8_1","volume-title":"Achieving 100% throughput in an input-queued switch,\" Proceedings of Infocom","author":"McKeown N.","year":"1996","unstructured":"McKeown , N. , V. Anantharam and J. Walrand . \" Achieving 100% throughput in an input-queued switch,\" Proceedings of Infocom , 1996 . McKeown, N., V. Anantharam and J. Walrand. \"Achieving 100% throughput in an input-queued switch,\" Proceedings of Infocom, 1996."},{"key":"e_1_3_2_1_9_1","volume-title":"The Tiny Tera: a packet switch core,\" Hot Interconnects","author":"McKeown N.","year":"1996","unstructured":"McKeown , N. , M. Izzard ., A. Mekkittikul , W. Ellersick and M. Horowitz . \" The Tiny Tera: a packet switch core,\" Hot Interconnects , 1996 . McKeown, N., M. Izzard., A. Mekkittikul, W. Ellersick and M. Horowitz. \"The Tiny Tera: a packet switch core,\" Hot Interconnects, 1996."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.769767"},{"key":"e_1_3_2_1_11_1","unstructured":"Pappu P. J. Turner and K. Wong. \"Distributed Queueing in Scalable High Performance Routers \" Proceedings of Infocom 4\/03.  Pappu P. J. Turner and K. Wong. \"Distributed Queueing in Scalable High Performance Routers \" Proceedings of Infocom 4\/03."},{"key":"e_1_3_2_1_12_1","unstructured":"Szymanski T. and S. Shaikh. \"Markov Chain Analysis of Packet-Switched Banyans with Arbitrary Switch Sizes Queue Sizes Link multiplicities and Speedups \" Proceedings of Infocom 4\/89.  Szymanski T. and S. Shaikh. \"Markov Chain Analysis of Packet-Switched Banyans with Arbitrary Switch Sizes Queue Sizes Link multiplicities and Speedups \" Proceedings of Infocom 4\/89."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3485"}],"event":{"name":"SIGCOMM04: ACM SIGCOMM 2004 Conference","location":"Portland Oregon USA","acronym":"SIGCOMM04","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1015467.1015496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1015467.1015496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:23:45Z","timestamp":1750253025000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1015467.1015496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,30]]},"references-count":13,"alternative-id":["10.1145\/1015467.1015496","10.1145\/1015467"],"URL":"https:\/\/doi.org\/10.1145\/1015467.1015496","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1030194.1015496","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2004,8,30]]},"assertion":[{"value":"2004-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}