Peer-to-Peer Multicasting Inspired by Huffman Coding
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 crea...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Computer Networks and Communications |
| Online Access: | http://dx.doi.org/10.1155/2013/312376 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832554887838171136 |
|---|---|
| author | Bartosz Polaczyk Piotr Chołda Andrzej Jajszczyk |
| author_facet | Bartosz Polaczyk Piotr Chołda Andrzej Jajszczyk |
| author_sort | Bartosz Polaczyk |
| collection | DOAJ |
| description | 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 (RTT)
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. |
| format | Article |
| id | doaj-art-11e868076f0f472eb5a5fe7cd1a18476 |
| institution | Kabale University |
| issn | 2090-7141 2090-715X |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Computer Networks and Communications |
| spelling | doaj-art-11e868076f0f472eb5a5fe7cd1a184762025-02-03T05:50:09ZengWileyJournal of Computer Networks and Communications2090-71412090-715X2013-01-01201310.1155/2013/312376312376Peer-to-Peer Multicasting Inspired by Huffman CodingBartosz Polaczyk0Piotr Chołda1Andrzej Jajszczyk2AGH University of Science and Technology, Department of Telecommunications, Al. Mickiewicza 30, 30-059 Kraków, PolandAGH University of Science and Technology, Department of Telecommunications, Al. Mickiewicza 30, 30-059 Kraków, PolandAGH University of Science and Technology, Department of Telecommunications, Al. Mickiewicza 30, 30-059 Kraków, PolandStringent 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 (RTT) 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.http://dx.doi.org/10.1155/2013/312376 |
| spellingShingle | Bartosz Polaczyk Piotr Chołda Andrzej Jajszczyk Peer-to-Peer Multicasting Inspired by Huffman Coding Journal of Computer Networks and Communications |
| title | Peer-to-Peer Multicasting Inspired by Huffman Coding |
| title_full | Peer-to-Peer Multicasting Inspired by Huffman Coding |
| title_fullStr | Peer-to-Peer Multicasting Inspired by Huffman Coding |
| title_full_unstemmed | Peer-to-Peer Multicasting Inspired by Huffman Coding |
| title_short | Peer-to-Peer Multicasting Inspired by Huffman Coding |
| title_sort | peer to peer multicasting inspired by huffman coding |
| url | http://dx.doi.org/10.1155/2013/312376 |
| work_keys_str_mv | AT bartoszpolaczyk peertopeermulticastinginspiredbyhuffmancoding AT piotrchołda peertopeermulticastinginspiredbyhuffmancoding AT andrzejjajszczyk peertopeermulticastinginspiredbyhuffmancoding |