{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:45:31Z","timestamp":1770338731219,"version":"3.49.0"},"reference-count":37,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T00:00:00Z","timestamp":1342656000000},"content-version":"vor","delay-in-days":200,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0747525"],"award-info":[{"award-number":["CCF-0747525"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0964479"],"award-info":[{"award-number":["0964479"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1049541"],"award-info":[{"award-number":["1049541"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0747525"],"award-info":[{"award-number":["CCF-0747525"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0964479"],"award-info":[{"award-number":["0964479"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1049541"],"award-info":[{"award-number":["1049541"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0747525"],"award-info":[{"award-number":["CCF-0747525"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0964479"],"award-info":[{"award-number":["0964479"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1049541"],"award-info":[{"award-number":["1049541"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","award":["CCF-0747525"],"award-info":[{"award-number":["CCF-0747525"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","award":["0964479"],"award-info":[{"award-number":["0964479"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","award":["1049541"],"award-info":[{"award-number":["1049541"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2012,1]]},"abstract":"<jats:p>Lyapunov drift is a powerful tool for optimizing stochastic queueing networks subject to stability. However, the most convenient drift conditions often provide results in terms of a time average expectation, rather than a pure time average. This paper provides an extended drift\u2010plus\u2010penalty result that ensures stability with desired time averages with probability 1. The analysis uses the law of large numbers for martingale differences. This is applied to quadratic and subquadratic Lyapunov methods for minimizing the time average of a network penalty function subject to stability and to additional time average constraints. Similar to known results for time average expectations, this paper shows that pure time average penalties can be pushed arbitrarily close to optimality, with a corresponding tradeoff in average queue size. Further, in the special case of quadratic Lyapunov functions, the basic drift condition is shown to imply all major forms of queue stability.<\/jats:p>","DOI":"10.1155\/2012\/831909","type":"journal-article","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T05:12:29Z","timestamp":1342761149000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Stability and Probability 1 Convergence for Queueing Networks via Lyapunov Optimization"],"prefix":"10.1155","volume":"2012","author":[{"given":"Michael J.","family":"Neely","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2012,7,19]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.212277"},{"key":"e_1_2_11_3_2","unstructured":"NeelyM. J. Dynamic power allocation and routing for satellite and wireless networks with time varying channels [Ph.D. thesis] 2003 Massachusetts Institute of Technology LIDS Cambridge Mass USA."},{"key":"e_1_2_11_4_2","doi-asserted-by":"publisher","DOI":"10.1561\/1300000001"},{"key":"e_1_2_11_5_2","volume-title":"Nonlinear Programming","author":"Bertsekas D. P.","year":"1995"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658"},{"key":"e_1_2_11_7_2","volume-title":"Introduction to Probability Models","author":"Ross S.","year":"2002"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2329-1"},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3267-7"},{"key":"e_1_2_11_10_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004828"},{"key":"e_1_2_11_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.876219"},{"key":"e_1_2_11_12_2","doi-asserted-by":"crossref","unstructured":"NeelyM. J. Universal scheduling for networks with arbitrary traffic channels and mobility Proceedings of the 49th IEEE Conference on Decision and Control (CDC \u203210) December 2010 Atlanta Ga USA 1822\u20131829 2-s2.0-79953128872 https:\/\/doi.org\/10.1109\/CDC.2010.5717885.","DOI":"10.1109\/CDC.2010.5717885"},{"key":"e_1_2_11_13_2","unstructured":"AgrawalR.andSubramanianV. Optimality of certain channel aware scheduling policies Proceedings of the 40th Annual Allerton Conference on Communication Control and Computing October 2002 Monticello Ill USA."},{"key":"e_1_2_11_14_2","unstructured":"KushnerH.andWhitingP. Asymptotic properties of proportional-fair sharing algorithms Proceedings of the 40th Annual Allerton Conference on Communication Control and Computing May 2002."},{"key":"e_1_2_11_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-005-1450-0"},{"key":"e_1_2_11_16_2","doi-asserted-by":"crossref","unstructured":"LiQ.andNegiR. Scheduling in wireless networks under uncertainties: a greedy primal-dual approach 2010 http:\/\/arxiv.org\/abs\/1001.20502010.","DOI":"10.1109\/icc.2011.5963357"},{"key":"e_1_2_11_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897944"},{"key":"e_1_2_11_18_2","doi-asserted-by":"crossref","unstructured":"LinX.andShroffN. B. Joint rate control and scheduling in multihop wireless networks Proceedings of the 43rd IEEE Conference on Decision and Control December 2004 Paradise Island The Bahamas 1484\u20131489 2-s2.0-14344253075.","DOI":"10.1109\/CDC.2004.1430253"},{"key":"e_1_2_11_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.780463"},{"key":"e_1_2_11_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/35.900644"},{"key":"e_1_2_11_21_2","doi-asserted-by":"crossref","unstructured":"LeonardiE. MelliaM. NeriF. andAjmone MarsanM. Bounds on average delays and queue size averages and variances in input-queued cell-based switches Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM \u203201) April 2001 Anchorage Alaska USA 1095\u20131103 2-s2.0-0035009370.","DOI":"10.1109\/INFCOM.2001.916303"},{"key":"e_1_2_11_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.837349"},{"key":"e_1_2_11_23_2","doi-asserted-by":"crossref","unstructured":"KahaleN.andWrightP. E. Dynamic global packet routing in wireless networks Proceedings of the 16th IEEE Annual Conference on Computer Communications (INFOCOM \u203297) April 1997 1414\u20131421 2-s2.0-0031356116.","DOI":"10.1109\/INFCOM.1997.631182"},{"key":"e_1_2_11_24_2","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1103662957"},{"key":"e_1_2_11_25_2","doi-asserted-by":"publisher","DOI":"10.1137\/06067746X"},{"key":"e_1_2_11_26_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1075828046"},{"key":"e_1_2_11_27_2","doi-asserted-by":"crossref","unstructured":"ShahD.andWischikD. Optimal scheduling algorithms for input-queued switches Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM \u203206) April 2006 Barcelona Spain 1\u201311 2-s2.0-39049126638 https:\/\/doi.org\/10.1109\/INFOCOM.2006.238.","DOI":"10.1109\/INFOCOM.2006.238"},{"key":"e_1_2_11_28_2","doi-asserted-by":"crossref","unstructured":"JiT. AthanasopoulouE. andSrikantR. Optimal scheduling policies in small generalized switches Proceedings of the 28th IEEE Conference on Computer Communications (INFOCOM \u203209) April 2009 Rio De Janiero Brazil 2921\u20132925 2-s2.0-70349669489 https:\/\/doi.org\/10.1109\/INFCOM.2009.5062259.","DOI":"10.1109\/INFCOM.2009.5062259"},{"key":"e_1_2_11_29_2","unstructured":"VenkataramananV. J.andLinX. Structural properties of LDP for queue-length based wireless scheduling algorithms Proceedings of the 45th Annual Allerton Conference on Communication Control and Computing September 2007 Monticello Ill USA."},{"key":"e_1_2_11_30_2","doi-asserted-by":"crossref","unstructured":"LauV.andKohC. H. Tradeoff analysis of delay-power-CSIT quality of generalized dynamic backpressure algorithm for energy efficient OFDM systems Proceedings of the IEEE International Symposium on Information Theory August 2011 St Petersburg Russia 1287\u20131291.","DOI":"10.1109\/ISIT.2011.6033744"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1039639370"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.1.155"},{"key":"e_1_2_11_33_2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/978-1-4615-0805-2_9","volume-title":"Handbook of Markov Decision Processes: Methods and Applications","author":"Makowski A. M.","year":"2002"},{"key":"e_1_2_11_34_2","volume-title":"Introduction to Stochastic Dynamic Programming","author":"Ross S. M.","year":"1995"},{"key":"e_1_2_11_35_2","article-title":"On a strong law of large numbers for martingales","volume":"38","author":"Chow Y. S.","year":"1967","journal-title":"Annals of Mathematical Statistics"},{"key":"e_1_2_11_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-79995-2"},{"key":"e_1_2_11_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2067371"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2012\/831909.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2012\/831909.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2012\/831909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T23:52:17Z","timestamp":1743810737000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2012\/831909"}},"subtitle":[],"editor":[{"given":"P. G. L.","family":"Leach","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1155\/2012\/831909"],"URL":"https:\/\/doi.org\/10.1155\/2012\/831909","archive":["Portico"],"relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"value":"1110-757X","type":"print"},{"value":"1687-0042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]},"assertion":[{"value":"2011-08-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-04-11","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"831909"}}