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!
|
| Summary: | 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. |
|---|---|
| ISSN: | 2090-7141 2090-715X |