{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:44:56Z","timestamp":1770997496528,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/infcom.2013.6567053","type":"proceedings-article","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T16:12:57Z","timestamp":1375373577000},"page":"2472-2478","source":"Crossref","is-referenced-by-count":20,"title":["To send or not to send: Reducing the cost of data transmission"],"prefix":"10.1109","author":[{"given":"Leana","family":"Golubchik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Khuller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koyel","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492493"},{"key":"14","first-page":"1","article-title":"Network traffic modeling and prediction with ARIMA\/GARCH","author":"zhou","year":"2005","journal-title":"Proc of HET-NETs Conference"},{"key":"11","first-page":"801","article-title":"An optimal online algorithm for packet scheduling with agreeable deadlines","author":"li","year":"2005","journal-title":"Proc 10th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"12","author":"pinedo","year":"2006","journal-title":"Scheduling Theory Algorithms and Systems"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109594"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.24"},{"key":"1","year":"0"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555376"},{"key":"7","first-page":"489","article-title":"A 4\/3-competitive randomised algorithm for online packet scheduling with agreeable deadlines","author":"jez","year":"2010","journal-title":"27th International Symposium on Theoretical Aspects of Computer Science-STACS"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_12"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015478"},{"key":"4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-642-00975-4_21","article-title":"On the 95- percentile billing method","author":"dimitropoulos","year":"2009","journal-title":"Passive and Active Network Measurement"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380847"},{"key":"8","first-page":"239","article-title":"One to rule them all: A general randomized algorithm for buffer management with bounded delay","author":"jez","year":"2011","journal-title":"Proc 11th Eur Symp Algorithms"}],"event":{"name":"IEEE INFOCOM 2013 - IEEE Conference on Computer Communications","location":"Turin, Italy","start":{"date-parts":[[2013,4,14]]},"end":{"date-parts":[[2013,4,19]]}},"container-title":["2013 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6556116\/6566708\/06567053.pdf?arnumber=6567053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T13:14:34Z","timestamp":1498050874000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6567053\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/infcom.2013.6567053","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}