{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:54Z","timestamp":1772164014331,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,14]],"date-time":"2010-06-14T00:00:00Z","timestamp":1276473600000},"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":[[2010,6,14]]},"DOI":"10.1145\/1811039.1811067","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T09:11:04Z","timestamp":1276593064000},"page":"239-250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Qualitative properties of \u03b1-weighted scheduling policies"],"prefix":"10.1145","author":[{"given":"Devavrat","family":"Shah","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"John N.","family":"Tsitsiklis","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"Yuan","family":"Zhong","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964804182041"},{"key":"e_1_3_2_1_2_1","volume-title":"Nonlinear Programming","author":"Bertsekas D.","year":"1999","unstructured":"D. Bertsekas . Nonlinear Programming . Athena Scientific , 1999 . D. Bertsekas. Nonlinear Programming. Athena Scientific, 1999."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1015345407"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AAP522"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.471210"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832229"},{"key":"e_1_3_2_1_7_1","volume-title":"Resource Allocation and Cross--Layer Control in Wireless Networks. Foundations and Trends in Networking","author":"Georgiadis L.","year":"2006","unstructured":"L. Georgiadis , M. Neely , and L. Tassiluas . Resource Allocation and Cross--Layer Control in Wireless Networks. Foundations and Trends in Networking , Now Publishers , 2006 . L. Georgiadis, M. Neely, and L. Tassiluas. Resource Allocation and Cross--Layer Control in Wireless Networks. Foundations and Trends in Networking, Now Publishers, 2006."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.810496"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198572237.001.0001","volume-title":"Probability and Random Processes","author":"Grimmett G.","year":"2001","unstructured":"G. Grimmett and D. Stirzaker . Probability and Random Processes . Oxford University Press , 2001 . G. Grimmett and D. Stirzaker. Probability and Random Processes. Oxford University Press, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1019737665"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/105051604000000224"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of Allerton Conference on Communication, Control and Computing","author":"Keslassy I.","year":"2001","unstructured":"I. Keslassy and N. McKeown . Analysis of scheduling algorithms that provide 100% throughput in input-queued switches . In Proceedings of Allerton Conference on Communication, Control and Computing , 2001 . I. Keslassy and N. McKeown. Analysis of scheduling algorithms that provide 100% throughput in input-queued switches. In Proceedings of Allerton Conference on Communication, Control and Computing, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797739"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.769767"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1895807.1895852"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555365"},{"key":"e_1_3_2_1_17_1","volume-title":"Optimal scheduling algorithm for input queued switch","author":"Shah D.","year":"2006","unstructured":"D. Shah and D. J. Wischik . Optimal scheduling algorithm for input queued switch . In Proceeding of IEEE INFOCOM , 2006 . D. Shah and D. J. Wischik. Optimal scheduling algorithm for input queued switch. In Proceeding of IEEE INFOCOM, 2006."},{"key":"e_1_3_2_1_18_1","volume-title":"The teleology of scheduling algorithms for switched networks under light load, critical load, and overload","author":"Shah D.","unstructured":"D. Shah and D. J. Wischik . The teleology of scheduling algorithms for switched networks under light load, critical load, and overload . http:\/\/web.mit.edu\/~devavrat\/www\/shahwischik.pdf, 2007-09. D. Shah and D. J. Wischik. The teleology of scheduling algorithms for switched networks under light load, critical load, and overload. http:\/\/web.mit.edu\/~devavrat\/www\/shahwischik.pdf, 2007-09."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1075828046"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-008-9072-y"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665071"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"e_1_3_2_1_23_1","volume-title":"45th Annual Allerton Conference on Communication, Control, and Computing","author":"Venkataramanan V. J.","year":"2007","unstructured":"V. J. Venkataramanan and X. Lin . Structural properties of LDP for queue--length based wireless scheduling algorithms . In 45th Annual Allerton Conference on Communication, Control, and Computing , September 2007 . V. J. Venkataramanan and X. Lin. Structural properties of LDP for queue--length based wireless scheduling algorithms. In 45th Annual Allerton Conference on Communication, Control, and Computing, September 2007."},{"key":"e_1_3_2_1_24_1","volume-title":"47th Annual Allerton Conference on Communication, Control, and Computing","author":"Venkataramanan V. J.","year":"2009","unstructured":"V. J. Venkataramanan and X. Lin . On the large-deviations optimality of scheduling policies minimizing the drift of a lyapunov function . In 47th Annual Allerton Conference on Communication, Control, and Computing , September 2009 . V. J. Venkataramanan and X. Lin. On the large-deviations optimality of scheduling policies minimizing the drift of a lyapunov function. In 47th Annual Allerton Conference on Communication, Control, and Computing, September 2009."},{"key":"e_1_3_2_1_25_1","unstructured":"D. Shah J. N. Tsitsiklis and Y. Zhong. Qualitative properties of \u00b1-weighted scheduling policies. http:\/\/www.mit.edu\/~zhyu4118\/sig_paper.pdf. D. Shah J. N. Tsitsiklis and Y. Zhong. Qualitative properties of \u00b1-weighted scheduling policies. http:\/\/www.mit.edu\/~zhyu4118\/sig_paper.pdf."}],"event":{"name":"SIGMETRICS '10: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","location":"New York New York USA","acronym":"SIGMETRICS '10","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1811039.1811067","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1811039.1811067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:23:02Z","timestamp":1750231382000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1811039.1811067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,14]]},"references-count":25,"alternative-id":["10.1145\/1811039.1811067","10.1145\/1811039"],"URL":"https:\/\/doi.org\/10.1145\/1811039.1811067","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1811099.1811067","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,6,14]]},"assertion":[{"value":"2010-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}