{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:50:57Z","timestamp":1729626657344,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1109\/allerton.2009.5394766","type":"proceedings-article","created":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T12:35:50Z","timestamp":1264509350000},"page":"462-468","source":"Crossref","is-referenced-by-count":7,"title":["Queue length analysis for multicast: Limits of performance and achievable queue length with random linear coding"],"prefix":"10.1109","author":[{"given":"Randy","family":"Cogill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brooke","family":"Shrader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Fountain codes","author":"mackay","year":"1998","journal-title":"Proc IEE Workshop on Discrete Event Systems (WODES98)"},{"key":"ref11","article-title":"On the queueing delay of a multicast erasure channel","author":"shrader","year":"2006","journal-title":"Proceedings of The IEEE Information Theory Workshop"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2007.4454981"},{"article-title":"Queueing advantages of network coding","year":"2007","author":"sundararajan","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITWITWN.2007.4318066"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595268"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1145\/285237.285258","article-title":"A digital fountain approach to reliable distribution of bulk data","volume":"98","author":"byers","year":"1998","journal-title":"Proceedings of ACM SIGCOMM"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/5.21076"},{"key":"ref6","article-title":"Stable throughput for multicast with random linear coding","author":"cogill","year":"2008","journal-title":"submitted"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594942"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2007.4298308"},{"journal-title":"Applied Probability and Queues","year":"2003","author":"asmussen","key":"ref2"},{"key":"ref1","article-title":"Queueing models for network coding","author":"abdelrahman","year":"2009","journal-title":"IEEE Information Theory Workshop"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2006.1666502"}],"event":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2009,9,30]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2009,10,2]]}},"container-title":["2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5375733\/5394483\/05394766.pdf?arnumber=5394766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T06:51:27Z","timestamp":1558767087000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5394766\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/allerton.2009.5394766","relation":{},"subject":[],"published":{"date-parts":[[2009,9]]}}}