Scalable video streaming over P2P networks: A matter of harmony?

Abstract

Abstract-In this paper we address the problem of efficient layered video streaming over peer-to-peer networks and we propose a new receiver-driven streaming mechanism. The main design goal of our new layered video requesting policy is to optimize the overall distribution of video streams in terms of reliability and overhead. Since the layered peer-to-peer streaming problem is NP-Hard, we show that the classic approaches widely used in layered P2P streaming systems have some limitations and we propose an optimization technique based on harmony search which aims at increasing the rate of successful data transmissions for the most important video layers, while reducing the protocol overhead and ensuring load balancing among the participating peers. Analytical results have demonstrated that our new requesting policy enhances the streaming of layered video over mesh-based peer-to-peer networks and outperforms classic approaches.

Differenciated bandwidth allocation in P2P layered streaming

“…However, none of these works have taken into consideration the layered streaming properties, mostly the layers dependency. Many recent works, such as [7] [8], leverage the characteristics of SVC and P2P networks and propose adaptive video streaming mechanisms. In [7], authors propose an optimization technique based on harmony search algorithm in order to increase the delivery ratio for the most important layers, while reducing the overhead and ensuring load balancing in the overlay.…”

“…Many recent works, such as [7] [8], leverage the characteristics of SVC and P2P networks and propose adaptive video streaming mechanisms. In [7], authors propose an optimization technique based on harmony search algorithm in order to increase the delivery ratio for the most important layers, while reducing the overhead and ensuring load balancing in the overlay. Authors in [8] propose taxation based P2P layered streaming designs, including layer subscription policy, chunk scheduling strategy and mesh topology adaptation.…”

Avoiding Quality Bottlenecks in P2P Adaptive Streaming

“…Determining the highest quality that can be obtained from a certain neighborhood, under the above constraints is known to be NP-Hard [36]. To solve it, we devise a heuristic solution called the Themis Heuristic.…”