Abstract
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.
Highlights
For previous few years peer-to-peer (P2P) related flows have represented a vast majority of the whole Internet traffic
We model a deteriorated quality of experience (QoE) caused by a multihop overlay path and observed by peer i, as s(i), where s (i) d=ef p (i) + ∑ p (j), (4)
Peers were grouped into five Internet service providers (ISPs) networks (ISP A–E), where each ISP was connected to one of the backbone routers with a symmetric speed of 10 Mbit/s
Summary
For previous few years peer-to-peer (P2P) related flows (overlay traffic) have represented a vast majority of the whole Internet traffic. To accomplish the gapless playback, the P2P application-layer links should be set over short distances with additional care about the available capacity This task is a nontrivial problem as P2P systems were invented to be underlay-agnostic. They have not usually recognized proximity between the candidate peers nor estimate attainable bandwidth. The Huffman algorithm constructs a tree representing a code of the shortest average codeword length, calculated as the sum of the paths from the root to the leaves (messages). In Huffmies, a similar mechanism is used to create a multicast streaming tree, where the root is a video server and leaves represent the peers. The paper is summarized, and a few challenges of the proposed method are discussed
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
