{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:12:37Z","timestamp":1761401557205},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T00:00:00Z","timestamp":1312156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1109\/tit.2011.2145630","type":"journal-article","created":{"date-parts":[[2011,8,4]],"date-time":"2011-08-04T01:26:02Z","timestamp":1312421162000},"page":"5072-5087","source":"Crossref","is-referenced-by-count":34,"title":["Peer-to-Peer Streaming Capacity"],"prefix":"10.1109","volume":"57","author":[{"given":"Sudipta","family":"Sengupta","sequence":"first","affiliation":[]},{"given":"Shao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Minghua","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Mung","family":"Chiang","sequence":"additional","affiliation":[]},{"given":"Jin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Philip A.","family":"Chou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250886"},{"key":"ref11","article-title":"Mutualcast: An efficient mechanism for one-to-many content distribution","author":"li","year":"2005","journal-title":"Proc ACM SIGCOMM Asia Workshop"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.39"},{"key":"ref13","article-title":"Performance bounds for large-scale heterogeneous p2p streaming system","author":"liu","year":"2008","journal-title":"Proc Allerton Conf 2008"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375493"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2008.917351"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007937"},{"key":"ref3","first-page":"1396","article-title":"On the shortest arborescence of a directed graph","author":"chu","year":"1965","journal-title":"Science Sinica"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743463"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282396"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1096"},{"key":"ref2","article-title":"Approximation algorithms for directed steiner tree problems","author":"charikar","year":"1998","journal-title":"Proc 9th Annu ACM-SIAM SODA"},{"key":"ref1","author":"bertsimas","year":"1997","journal-title":"Introduction to Linear Optimization"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.112"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5961798\/05961847.pdf?arnumber=5961847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:53:57Z","timestamp":1642006437000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5961847\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":15,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2145630","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8]]}}}