Peer-to-Peer Multicasting Inspired by Huffman Coding | Zendy

Bartosz Polaczyk | Zendy; Piotr Chołda | Zendy; Andrzej Jajszczyk | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Peer-to-Peer Multicasting Inspired by Huffman Coding

Author(s) -

Bartosz Polaczyk,

Piotr Chołda,

Andrzej Jajszczyk

Publication year - 2013

Publication title -

journal of computer networks and communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.355

H-Index - 23

eISSN - 2090-715X

pISSN - 2090-7141

DOI - 10.1155/2013/312376

Subject(s) - multicast , computer science , computer network , huffman coding , distributed computing , overlay multicast , locality , peer to peer , quality of service , overlay , coding (social sciences) , overlay network , multiple description coding , xcast , inter domain , the internet , algorithm , data compression , linguistics , philosophy , statistics , mathematics , world wide web , programming language , network packet

Stringent QoS requirements of video streaming arenot addressed by the delay characteristics of highly dynamic peer-to-peer (P2P) networks. To solve this problem, a novel locality-awaremethod for choosing optimal neighbors in live streamingmulticast P2P overlays is presented in this paper. To create theappropriate 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 sourcecoding 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 approachconsiderably improves the overlay efficiency from theviewpoint of end-users and content providers. Moreover, theproposed technique ensures a high level of resilience againstgateway-link failures and adaptively reorganizes the overlaytopology in case of dynamic, transient network fluctuations

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research