{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:41:38Z","timestamp":1777902098669,"version":"3.51.4"},"reference-count":20,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2006,2]]},"abstract":"<jats:p>For single-source, single-tree-based peer-to-peer live media streaming, it is generally believed that a short (and wide) tree has a good comprehensive performance in terms of reliability and service delay. While the short tree directly benefits delay optimization, it is unclear whether such a structure maximizes tree reliability, which is sometimes more critical for a streaming Internet service. This article studies several prevalent overlay construction algorithms from the aspects of (1) service reliability, (2) service delay, and (3) protocol overhead. Two types of peer layout, bandwidth-ordered layout and time-ordered layout, are identified, and their performance is evaluated. The analytical results show that, by appropriately placing peers according to their time properties, the tree achieves a much higher degree of reliability than the depth-optimized tree. This finding motivates the design of a heap algorithm, which aims for combining the strengths of both bandwidth ordering and time ordering. It dynamically moves peers between difference layers of the tree according to a simple metric and gradually adjusts the tree toward a layout partially ordered in time and partially ordered in bandwidth. In so doing, the tree has advantages in both service reliability and delay. Extensive simulations show that this new algorithm achieves better comprehensive performance than existing algorithms.<\/jats:p>","DOI":"10.1177\/0037549706065877","type":"journal-article","created":{"date-parts":[[2006,5,18]],"date-time":"2006-05-18T05:17:46Z","timestamp":1147929466000},"page":"93-106","source":"Crossref","is-referenced-by-count":6,"title":["Performance Analysis and Improvement of Overlay Construction for Peer-to-Peer                 Live Streaming"],"prefix":"10.1177","volume":"82","author":[{"given":"Guang","family":"Tan","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Warwick, Coventry, CV4 7AL,                         United Kingdom,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen A.","family":"Jarvis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinuo","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel P.","family":"Spooner","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Warwick, Coventry, CV4 7AL,                         United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2006,2,1]]},"reference":[{"key":"atypb1","volume-title":"Proceedings of ACM SIGMETRICS","author":"Chu, Y."},{"key":"atypb2","volume-title":"Proceedings of the 3rd Usenix Symposium on Internet Technologies and Systems","author":"Pendarakis, D."},{"key":"atypb3","volume-title":"Proceedings of ACM SIGCOMM 2002","author":"Banerjee, S."},{"key":"atypb4","unstructured":"Chawathe, Y. 2000. Scattercast: An architecture for Internet broadcast                 distribution as an infrastructure service. Ph.D. diss., University of California, Berkeley."},{"key":"atypb5","volume-title":"Proceedings of USENIX 2004 Annual Technical Conference","author":"Chu, Y."},{"key":"atypb6","volume-title":"ACM NOSSDAV","author":"Padmanabhan, V. N."},{"key":"atypb7","volume-title":"Proceedings of ACM SIGCOMM","author":"Sripanidkulchai, K."},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818803"},{"key":"atypb9","volume-title":"Proceedings of INFOCOM","author":"Guo, M."},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.863709"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.826277"},{"key":"atypb12","volume-title":"11th IEEE International Conference on Network Protocols (ICNP)","author":"Padmanabhan, V. N."},{"key":"atypb13","volume-title":"Proceedings of the 4th ACM SIGCOMM IMC","author":"Sripanidkulchai, K."},{"key":"atypb14","volume-title":"Modeling and analysis of stochastic systems","author":"Kulkarni, V. G.","year":"1996"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1002\/0471722162"},{"key":"atypb16","volume-title":"Proceedings of Multimedia Computing and Networking (MMCN)","author":"Saroiu, S."},{"key":"atypb17","volume-title":"Department of Computer Science","author":"Tan, G.","year":"2005"},{"key":"atypb18","volume-title":"Proceedings of Multimedia Computing and Networking (MMCN)","author":"Ooi, W. T."},{"key":"atypb19","volume-title":"Proceedings of ACM SIGCOMM","author":"Chu, Y."},{"key":"atypb20","volume-title":"Proceedings of IEEE INFOCOM'96","author":"Zegura, E. W."}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549706065877","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549706065877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:19:36Z","timestamp":1777634376000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549706065877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1177\/0037549706065877"],"URL":"https:\/\/doi.org\/10.1177\/0037549706065877","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}