{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:14Z","timestamp":1763467934981,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,18]],"date-time":"2009-05-18T00:00:00Z","timestamp":1242604800000},"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":[[2009,5,18]]},"DOI":"10.1145\/1530748.1530757","type":"proceedings-article","created":{"date-parts":[[2009,7,15]],"date-time":"2009-07-15T13:51:31Z","timestamp":1247665891000},"page":"55-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Delay and effective throughput of wireless scheduling in heavy traffic regimes"],"prefix":"10.1145","author":[{"given":"Yung","family":"Yi","sequence":"first","affiliation":[{"name":"KAIST, Daejon, South Korea"}]},{"given":"Junshan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]},{"given":"Mung","family":"Chiang","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,5,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012999358464"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019160803783"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of Allerton","author":"Chaporkar P.","year":"2005","unstructured":"P. Chaporkar , K. Kar , and S. Sarkar . Throughput guarantees through maximal scheduling in wireless networks . In Proceedings of Allerton , 2005 . P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees through maximal scheduling in wireless networks. In Proceedings of Allerton, 2005."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01149260"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5301-1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004828"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AAP522"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.65"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062162"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.11"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557418"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/1427465"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.376968"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of IEEE Infocom","author":"Lin X.","year":"2005","unstructured":"X. Lin and N.B. Shroff . The impact of imperfect scheduling on cross-layer rate control in wireless networks . In Proceedings of IEEE Infocom , 2005 . X. Lin and N.B. Shroff. The impact of imperfect scheduling on cross-layer rate control in wireless networks. In Proceedings of IEEE Infocom, 2005."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140283"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of CISS","author":"Neely M.J.","year":"2002","unstructured":"M.J. Neely , E. Modiano , and C.E. Rohrs . Tradeoffs in delay guarantees and computation complexity for nxn packet switches . In Proceedings of CISS , 2002 . M.J. Neely, E. Modiano, and C.E. Rohrs. Tradeoffs in delay guarantees and computation complexity for nxn packet switches. In Proceedings of CISS, 2002."},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of Information Theory and Applications Second Workshop","author":"Ray S.","year":"2007","unstructured":"S. Ray and S. Sarkar . Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning . In Proceedings of Information Theory and Applications Second Workshop , 2007 . S. Ray and S. Sarkar. Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning. In Proceedings of Information Theory and Applications Second Workshop, 2007."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1254882.1254920"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.238"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.917736"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1103662957"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1075828046"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of Allerton","author":"Stolyar A.L.","year":"2006","unstructured":"A.L. Stolyar . Large deviations of queues under qos scheduling algorithms . In Proceedings of Allerton , 2006 . A.L. Stolyar. Large deviations of queues under qos scheduling algorithms. In Proceedings of Allerton, 2006."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665071"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of Allerton","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 Proceedings of Allerton , 2007 . V.J. Venkataramanan and X. Lin. Structural properties of ldp for queue-length based wireless scheduling algorithms. In Proceedings of Allerton, 2007."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"W. Whitt. Stochastic-Process Limits. Springer-Verlag 2001.  W. Whitt. Stochastic-Process Limits. Springer-Verlag 2001.","DOI":"10.1007\/b97479"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019156702875"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of IEEE Infocom","author":"Wu X.","year":"2006","unstructured":"X. Wu and R. Srikant . Bounds on the capacity region of multi-hop wireless networks under distributed greedy scheduling . In Proceedings of IEEE Infocom , 2006 . X. Wu and R. Srikant. Bounds on the capacity region of multi-hop wireless networks under distributed greedy scheduling. In Proceedings of IEEE Infocom, 2006."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374624"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883633"}],"event":{"name":"MobiHoc '09: The Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","ACM Association for Computing Machinery"],"location":"New Orleans LA USA","acronym":"MobiHoc '09"},"container-title":["Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1530748.1530757","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1530748.1530757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:22Z","timestamp":1750253422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1530748.1530757"}},"subtitle":["vacation model for complexity"],"short-title":[],"issued":{"date-parts":[[2009,5,18]]},"references-count":31,"alternative-id":["10.1145\/1530748.1530757","10.1145\/1530748"],"URL":"https:\/\/doi.org\/10.1145\/1530748.1530757","relation":{},"subject":[],"published":{"date-parts":[[2009,5,18]]},"assertion":[{"value":"2009-05-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}