{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:08Z","timestamp":1772164088756,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T00:00:00Z","timestamp":1496620800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council grant","award":["DP110103505"],"award-info":[{"award-number":["DP110103505"]}]},{"name":"US NSF grants","award":["CNS-1423182, CNS-1302197"],"award-info":[{"award-number":["CNS-1423182, CNS-1302197"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,5]]},"DOI":"10.1145\/3078505.3078509","type":"proceedings-article","created":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T08:47:29Z","timestamp":1496825249000},"page":"4-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Queue-Proportional Sampling"],"prefix":"10.1145","author":[{"given":"Long","family":"Gong","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"Paul","family":"Tune","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, Australia"}]},{"given":"Liang","family":"Liu","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"Sen","family":"Yang","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"Jun (Jim)","family":"Xu","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Histogram: A High Dynamic Range (HDR) Histogram. https:\/\/github.com\/HdrHistogram\/HdrHistogram.  Histogram: A High Dynamic Range (HDR) Histogram. https:\/\/github.com\/HdrHistogram\/HdrHistogram."},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.198"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.59"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915695"},{"key":"e_1_3_2_1_6_1","first-page":"147","volume-title":"Tres observaciones sobre el algebra lineal. Univ. Nac. Tucum\u00e1n Rev. Ser. Abi 5","author":"Birkhoff G.","year":"1946","unstructured":"G. Birkhoff . 1946. Tres observaciones sobre el algebra lineal. Univ. Nac. Tucum\u00e1n Rev. Ser. Abi 5 ( 1946 ), pages 147 -- 151 . G. Birkhoff. 1946. Tres observaciones sobre el algebra lineal. Univ. Nac. Tucum\u00e1n Rev. Ser. Abi 5 (1946), pages 147--151."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of ITCom (Modeling and Design of Wireless Networks)","author":"Eryilmaz A.","unstructured":"A. Eryilmaz , R. Srikant , and J. R. Perkins . 2001. Throughput-optimal scheduling for broadcast channels . In Proceedings of ITCom (Modeling and Design of Wireless Networks) . Denver, CO. A. Eryilmaz, R. Srikant, and J. R. Perkins. 2001. Throughput-optimal scheduling for broadcast channels. In Proceedings of ITCom (Modeling and Design of Wireless Networks). Denver, CO."},{"key":"e_1_3_2_1_9_1","first-page":"954","volume-title":"49th IEEE Conference on Decision and Control (CDC).","author":"Ghaderi J.","unstructured":"J. Ghaderi and R. Srikant . 2010. On the design of efficient CSMA algorithms for wireless networks . In 49th IEEE Conference on Decision and Control (CDC). pages 954 -- 959 . 0191--2216 J. Ghaderi and R. Srikant. 2010. On the design of efficient CSMA algorithms for wireless networks. In 49th IEEE Conference on Decision and Control (CDC). pages 954--959. 0191--2216"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.810496"},{"key":"e_1_3_2_1_11_1","first-page":"1634","volume-title":"Proceedings of the IEEE INFOCOM.","volume":"3","author":"Goudreau M. W.","unstructured":"M. W. Goudreau , S. G. Kolliopoulos , and S. B. Rao . 2000. Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation . In Proceedings of the IEEE INFOCOM. pages 1634 -- 1643 vol. 3 . M. W. Goudreau, S. G. Kolliopoulos, and S. B. Rao. 2000. Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation. In Proceedings of the IEEE INFOCOM. pages 1634--1643 vol.3."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555361"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1987.1096719"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the Allerton Conference on Communication, Control and Computing.","author":"Keslassy I.","unstructured":"I. Keslassy and N. McKeown . 2001. Analysis of scheduling algorithms that provide 100% throughput in input-queued switches . In Proceedings of the Allerton Conference on Communication, Control and Computing. I. Keslassy and N. McKeown. 2001. Analysis of scheduling algorithms that provide 100% throughput in input-queued switches. In Proceedings of the Allerton Conference on Communication, Control and Computing."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745864"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.769767"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.780463"},{"key":"e_1_3_2_1_19_1","first-page":"792","volume-title":"Proceedings of the IEEE INFOCOM.","volume":"2","author":"Mekkittikul A.","unstructured":"A. Mekkittikul and N. McKeown . 1998. A practical scheduling algorithm to achieve 100% throughput in input-queued switches . In Proceedings of the IEEE INFOCOM. pages 792 -- 799 vol. 2 . 0743--166X A. Mekkittikul and N. McKeown. 1998. A practical scheduling algorithm to achieve 100% throughput in input-queued switches. In Proceedings of the IEEE INFOCOM. pages 792--799 vol.2. 0743--166X"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140283"},{"key":"e_1_3_2_1_21_1","first-page":"5","volume-title":"A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games 2","author":"v. Neumann J.","year":"1953","unstructured":"J. v. Neumann . 1953. A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games 2 ( 1953 ), pages 5 -- 12 . J. v. Neumann. 1953. A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games 2 (1953), pages 5--12."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2177101"},{"key":"e_1_3_2_1_23_1","unstructured":"I. Olkin and A. W. Marshall. 2016. Inequalities: theory of majorization and its applications. Academic press.  I. Olkin and A. W. Marshall. 2016. Inequalities: theory of majorization and its applications. Academic press."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555365"},{"key":"e_1_3_2_1_25_1","first-page":"1647","volume-title":"Queue Proportional Scheduling in Gaussian Broadcast Channels. In 2006 IEEE International Conference on Communications","volume":"4","author":"Seong K.","unstructured":"K. Seong , R. Narasimhan , and J. M. Cioffi . 2006 . Queue Proportional Scheduling in Gaussian Broadcast Channels. In 2006 IEEE International Conference on Communications , Vol. 4 . pages 1647 -- 1652 . 1550--3607 K. Seong, R. Narasimhan, and J. M. Cioffi. 2006. Queue Proportional Scheduling in Gaussian Broadcast Channels. In 2006 IEEE International Conference on Communications, Vol. 4. pages 1647--1652. 1550--3607"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879404"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/40.988685"},{"key":"e_1_3_2_1_28_1","first-page":"1024","volume-title":"Proceedings of the IEEE INFOCOM","volume":"2","author":"Shah D.","unstructured":"D. Shah and M. Kopikare . 2002. Delay bounds for approximate maximum weight matching algorithms for input queued switches . In Proceedings of the IEEE INFOCOM , Vol. 2 . pages 1024 -- 1031 vol.2. 0743--166X D. Shah and M. Kopikare. 2002. Delay bounds for approximate maximum weight matching algorithms for input queued switches. In Proceedings of the IEEE INFOCOM, Vol. 2. pages 1024--1031 vol.2. 0743--166X"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AAP763"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254762"},{"key":"e_1_3_2_1_31_1","volume-title":"Optimal Scheduling Algorithms for Input-Queued Switches. In Proceedings of the IEEE INFOCOM","author":"Shah D.","unstructured":"D. Shah and D. Wischik . 2006 . Optimal Scheduling Algorithms for Input-Queued Switches. In Proceedings of the IEEE INFOCOM . Barcelona, Spain, pages 1--11. 0743--166X D. Shah and D. Wischik. 2006. Optimal Scheduling Algorithms for Input-Queued Switches. In Proceedings of the IEEE INFOCOM. Barcelona, Spain, pages 1--11. 0743--166X"},{"key":"e_1_3_2_1_32_1","first-page":"1","volume-title":"Proceedings of the IEEE INFOCOM.","author":"Shah D.","unstructured":"D. Shah and D. Wischik . 2006. Optimal Scheduling Algorithms for Input-Queued Switches . In Proceedings of the IEEE INFOCOM. pages 1 -- 11 . D. Shah and D. Wischik. 2006. Optimal Scheduling Algorithms for Input-Queued Switches. In Proceedings of the IEEE INFOCOM. pages 1--11."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665071"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"e_1_3_2_1_35_1","first-page":"191","volume-title":"Journal of Applied Probability","author":"Tweedie R.","year":"1983","unstructured":"R. Tweedie . 1983 . The existence of moments for stationary Markov chains . Journal of Applied Probability (1983), pages 191 -- 196 . R. Tweedie. 1983. The existence of moments for stationary Markov chains. Journal of Applied Probability (1983), pages 191--196."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.37236\/1552"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2591987"},{"key":"e_1_3_2_1_38_1","first-page":"1683","volume-title":"Proceedings of the 48th Annual Allerton Conference.","author":"Ye S.","unstructured":"S. Ye , T. Shen , and S. Panwar . 2010. An O(1) Scheduling Algorithm for Variable-Size Packet Switching Systems . In Proceedings of the 48th Annual Allerton Conference. pages 1683 -- 1690 . S. Ye, T. Shen, and S. Panwar. 2010. An O(1) Scheduling Algorithm for Variable-Size Packet Switching Systems. In Proceedings of the 48th Annual Allerton Conference. pages 1683--1690."}],"event":{"name":"SIGMETRICS '17: ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems","location":"Urbana-Champaign Illinois USA","acronym":"SIGMETRICS '17","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Proceedings of the 2017 ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3078505.3078509","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3078505.3078509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:03:33Z","timestamp":1750201413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3078505.3078509"}},"subtitle":["A Better Approach to Crossbar Scheduling for Input-Queued Switches"],"short-title":[],"issued":{"date-parts":[[2017,6,5]]},"references-count":37,"alternative-id":["10.1145\/3078505.3078509","10.1145\/3078505"],"URL":"https:\/\/doi.org\/10.1145\/3078505.3078509","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3143314.3078509","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,6,5]]},"assertion":[{"value":"2017-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}