Evaluating the 2PC Algorithm for the Maintenance of P2P Live Streaming

Abstract

Peer-to-Peer (P2P) Networks for live streaming face challenges such as ensuring low latency and low discontinuity in media transmission among peers. Algorithms for constructing and maintaining the overlay are often proposed to address several of these challenges. However, it is common to find works that present positive results from the execution of these algorithms without showing the overlay structure constructed by them. In this article, we analyze the overlay constructed and maintained by the Peer Classification for Partnership Constraints (2PC) algorithm. 2PC proved to be efficient in dealing with a large number of free-riders on the network, imposing constraints on partnerships between peers according to their contributions to media transmission. To understand the 2PC execution effects supported by the K-Shortest Path Yen's algorithm, we evaluated the application of the 2PC and identified that the partnership relationships between peers imposed by the algorithm organize the overlay attracting high-contribution peers close to the server, while pushing low-contribution peers to the edge of the overlay.