{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T00:48:21Z","timestamp":1741308501306,"version":"3.38.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5934932","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T14:59:10Z","timestamp":1310050750000},"page":"1449-1457","source":"Crossref","is-referenced-by-count":16,"title":["The streaming capacity of sparsely-connected P2P systems with distributed control"],"prefix":"10.1109","author":[{"given":"Can","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375493"},{"key":"ref11","article-title":"Streaming capacity in peer-to-peer networks with topology constraints","author":"sengupta","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.39"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945474"},{"key":"ref14","first-page":"127","article-title":"Chainsaw: Eliminating trees from overlay multicast","author":"pai","year":"2005","journal-title":"IPTPS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062220"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/INFCOM.2009.5061908","article-title":"Queuing network models for multi-channel P2P live streaming systems","author":"wu","year":"2009","journal-title":"IEEE INFOCOM"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.129"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851725"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1386109.1386112"},{"key":"ref3","article-title":"Measuring P2P IPTV systems","author":"silerston","year":"2007","journal-title":"Proc of NOSSDAV'07"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.112"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2009.5360690"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459396"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2008.03.003"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1109\/TMM.2007.907451","article-title":"A measurement study of a large-scale P2P IPTV system","volume":"9","author":"hei","year":"2007","journal-title":"IEEE Transactions on Multimedia"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375494"},{"key":"ref1","first-page":"2102","article-title":"Coolstreaming\/donet: a data-driven overlay network for peer-to-peer live media streaming","volume":"3","author":"zhang","year":"2005","journal-title":"Proceedings IEEE Infocom"},{"key":"ref20","first-page":"91","article-title":"Edge-disjoint branchings","author":"edmonds","year":"1973","journal-title":"Combinatorial Algorithms"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"journal-title":"A First Course in Probability","year":"1998","author":"ross","key":"ref24"},{"key":"ref23","article-title":"The streaming capacity of sparsely-connected P2P system with low complexity algorithm","author":"zhao","year":"2010","journal-title":"Tech Rep"},{"key":"ref26","article-title":"A faster algorithm for finding the minimum cut in a graph","author":"hao","year":"1992","journal-title":"SODA ‘92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522355.001.0001","author":"barbour","year":"1992","journal-title":"Poisson Approximation"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","start":{"date-parts":[[2011,4,10]]},"location":"Shanghai, China","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05934932.pdf?arnumber=5934932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T00:20:35Z","timestamp":1741306835000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5934932\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5934932","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}