{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T18:39:06Z","timestamp":1740163146910,"version":"3.37.3"},"reference-count":9,"publisher":"Wiley","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Polish National Science Centre","doi-asserted-by":"crossref","award":["N N517 555239"],"award-info":[{"award-number":["N N517 555239"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer Networks and Communications"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>Stringent QoS requirements of video streaming are not addressed by the delay characteristics of highly dynamic peer-to-peer (P2P) networks. To solve this problem, a novel locality-aware method for choosing optimal neighbors in live streaming multicast P2P overlays is presented in this paper. To create the appropriate multicast tree topology, a round-trip-time (<jats:italic>RTT<\/jats:italic>) value is used as a parameter distinguishing peers capabilities. The multicast tree construction is based on the Huffman source coding algorithm. First, a centrally managed version is presented, and then an effective use of a distributed paradigm is shown. Performance evaluation results prove that the proposed approach considerably improves the overlay efficiency from the viewpoint of end-users and content providers. Moreover, the proposed technique ensures a high level of resilience against gateway-link failures and adaptively reorganizes the overlay topology in case of dynamic, transient network fluctuations.<\/jats:p>","DOI":"10.1155\/2013\/312376","type":"journal-article","created":{"date-parts":[[2013,5,30]],"date-time":"2013-05-30T21:15:33Z","timestamp":1369948533000},"page":"1-11","source":"Crossref","is-referenced-by-count":2,"title":["Peer-to-Peer Multicasting Inspired by Huffman Coding"],"prefix":"10.1155","volume":"2013","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7346-9139","authenticated-orcid":true,"given":"Bartosz","family":"Polaczyk","sequence":"first","affiliation":[{"name":"AGH University of Science and Technology, Department of Telecommunications, Al. Mickiewicza 30, 30-059 Krak\u00f3w, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Cho\u0142da","sequence":"additional","affiliation":[{"name":"AGH University of Science and Technology, Department of Telecommunications, Al. Mickiewicza 30, 30-059 Krak\u00f3w, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Jajszczyk","sequence":"additional","affiliation":[{"name":"AGH University of Science and Technology, Department of Telecommunications, Al. Mickiewicza 30, 30-059 Krak\u00f3w, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2007.08.046"},{"issue":"5","key":"10","first-page":"222","volume":"42","year":"2011","journal-title":"IEEE Communications Magazine"},{"issue":"1","key":"13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/JPROC.2007.909913","volume":"96","year":"2008","journal-title":"Proceedings of the IEEE"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1323651.1323653"},{"issue":"9","key":"15","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","year":"1952","journal-title":"Proceedings of the IRE"},{"issue":"6","key":"16","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","volume":"24","year":"1978","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","volume":"6","year":"1985","journal-title":"Journal of Algorithms"},{"issue":"4","key":"18","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","year":"1987","journal-title":"Journal of the ACM"},{"year":"1999","key":"20"}],"container-title":["Journal of Computer Networks and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2013\/312376.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2013\/312376.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2013\/312376.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T16:27:18Z","timestamp":1588955238000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jcnc\/2013\/312376\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":9,"alternative-id":["312376","312376"],"URL":"https:\/\/doi.org\/10.1155\/2013\/312376","relation":{},"ISSN":["2090-7141","2090-715X"],"issn-type":[{"type":"print","value":"2090-7141"},{"type":"electronic","value":"2090-715X"}],"subject":[],"published":{"date-parts":[[2013]]}}}