{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T17:05:24Z","timestamp":1724778324122},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1109\/tit.2012.2204031","type":"journal-article","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T18:03:16Z","timestamp":1339524196000},"page":"6556-6571","source":"Crossref","is-referenced-by-count":9,"title":["Optimal Dynamic Coding-Window Selection for Serving Deadline-Constrained Traffic Over Time-Varying Channels"],"prefix":"10.1109","volume":"58","author":[{"given":"Ruogu","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harsha","family":"Gangammanavar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atilla","family":"Eryilmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530772"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2100083"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110508"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2200\/S00271ED1V01Y201006CNT007"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900405"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208724"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2307\/1427590"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.821989"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-8216-3","author":"srikant","year":"2004","journal-title":"The Mathematics of Internet Congestion Control"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205883"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.210"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498459"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286588"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513290"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879361"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/9.29398"},{"key":"ref1","author":"bertsekas","year":"1995","journal-title":"Dynamic Programming and Optimal Control"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061954"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.568722"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.212277"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1991.147530"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6299030\/06216423.pdf?arnumber=6216423","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:44:52Z","timestamp":1516751092000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6216423\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":23,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2204031","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10]]}}}