{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:41:36Z","timestamp":1720201296772},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T00:00:00Z","timestamp":1427846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:00:00Z","timestamp":1555113600000},"content-version":"vor","delay-in-days":1473,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1016\/j.tcs.2014.11.033","type":"journal-article","created":{"date-parts":[[2014,12,6]],"date-time":"2014-12-06T01:03:47Z","timestamp":1417827827000},"page":"3-9","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Optimal serial broadcast of successive chunks"],"prefix":"10.1016","volume":"575","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.tcs.2014.11.033_br0010","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1109\/TPDS.2009.114","article-title":"Streamline: an optimal distribution algorithm for Peer-to-Peer real-time streaming","volume":"21","author":"Bianchi","year":"2010","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.tcs.2014.11.033_br0020","series-title":"Proc. of ACM SOSP'03","first-page":"298","article-title":"SplitStream: high-bandwidth content distribution in cooperative environments","author":"Castro","year":"2003"},{"key":"10.1016\/j.tcs.2014.11.033_br0030","series-title":"Proc. of 47th Annual Allerton Conference on Communication, Control, and Computing","first-page":"378","article-title":"P2P streaming capacity: survey and recent results","author":"Chen","year":"2009"},{"issue":"5","key":"10.1016\/j.tcs.2014.11.033_br0040","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1137\/S0097539793252870","article-title":"Optimal group gossiping in hypercubes under a circuit-switching model","volume":"25","author":"Fujita","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"10","key":"10.1016\/j.tcs.2014.11.033_br0050","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1109\/12.805160","article-title":"A fault tolerant broadcast scheme in star graphs under the single-port communication model","volume":"48","author":"Fujita","year":"1999","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.tcs.2014.11.033_br0060","series-title":"Proc. of IFIP Networking","first-page":"433","article-title":"AQCS: adaptive queue-based chunk scheduling for P2P live streaming","author":"Guo","year":"2008"},{"key":"10.1016\/j.tcs.2014.11.033_br0070","series-title":"Proc. of INFOCOM 2007","first-page":"919","article-title":"Stochastic fluid theory for P2P streaming systems","author":"Kumar","year":"2007"},{"key":"10.1016\/j.tcs.2014.11.033_br0080","series-title":"Proc. of 28th ICDCS","first-page":"53","article-title":"Is random scheduling sufficient in P2P video streaming?","author":"Liang","year":"2008"},{"key":"10.1016\/j.tcs.2014.11.033_br0090","series-title":"Proc. of MULTIMEDIA '07","first-page":"127","article-title":"On the minimum delay Peer-to-Peer video streaming: how realtime can it be?","author":"Liu","year":"2007"},{"key":"10.1016\/j.tcs.2014.11.033_br0100","series-title":"Proc. of ACM SIGMETRICS","first-page":"313","article-title":"Performance bounds for peer-assisted live streaming","author":"Liu","year":"2008"},{"key":"10.1016\/j.tcs.2014.11.033_br0110","series-title":"Proc. of ICDCS'10","first-page":"587","article-title":"P2P streaming capacity under node degree bound","author":"Liu","year":"2010"},{"key":"10.1016\/j.tcs.2014.11.033_br0120","series-title":"Proc. of IEEE Infocom","first-page":"1073","article-title":"Randomized decentralized broadcasting algorithm","author":"Massoulie","year":"2007"},{"issue":"3","key":"10.1016\/j.tcs.2014.11.033_br0130","first-page":"532","article-title":"Efficient multimedia distribution in source constraint networks","volume":"10","author":"Nguyen","year":"2008","journal-title":"IEEE Trans. Multimed."},{"issue":"8","key":"10.1016\/j.tcs.2014.11.033_br0140","doi-asserted-by":"crossref","first-page":"5072","DOI":"10.1109\/TIT.2011.2145630","article-title":"Peer-to-Peer streaming capacity","volume":"57","author":"Sengupta","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"10.1016\/j.tcs.2014.11.033_br0150","doi-asserted-by":"crossref","first-page":"1661","DOI":"10.1109\/TMM.2007.907469","article-title":"Coolstreaming: design, theory, and practice","volume":"9","author":"Xie","year":"2007","journal-title":"IEEE Trans. Multimed."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514009517?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514009517?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T21:52:07Z","timestamp":1555105927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397514009517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":15,"alternative-id":["S0304397514009517"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2014.11.033","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2015,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal serial broadcast of successive chunks","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2014.11.033","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}