A Peer-to-Peer Architecture for Media Streaming

Peer-to-Peer Networking and Applications, 2018

Mutualcast is a one-to-many (peer-to-peer) scheme for content distribution that maximizes the overall throughput during a broadacast session. It is based on a fully-connected graph (full mesh topology), which introduces benefits such as robustness or simultaneous transmission from/to multiple devices. The main disadvantage of Mutualcast is scalability; it is constraint to a small P2P group for content distribution. In this paper, we make Mutualcast scalable. We propose a highly collaborative and scalable P2P tree-based architecture made of two main components: 1) Peer grouping or clustering and 2) Hierarchical tree-based content distribution. In step 1), peer nodes (content receivers) are grouped into equal-size clusters by using a proposed heuristic size-constrained algorithm based on k-means. In step 2), clusters (which become the nodes of the tree) are organized into a single hierarchical n-ary tree-based architecture, in which the root of the tree (Root Cluster) is the one closest to source peer, while intermediate and leaf clusters are positioned in the tree according to their delay-proximity to previously inserted clusters. During content distribution, the root cluster receives the blocks of content before any other cluster in the tree and directly from (and only from) the source peer; blocks are then passed on to the next hierarchical level down the tree in order (higher levels of the tree receive the content before lower levels). Inter-clusters and intra-clusters content distribution is performed concurrently and takes into account peers upload/download capacities to relay blocks of content. The evaluation of our hierarchical P2P architecture concentrates on the following metrics: scalability of the systems, overall end-to-end delay distribution, and efficient cluster size. Finally, our architecture is compared against two well-known P2P technologies in the literature, Super-Peer and Kademlia.

Video streaming based on peer-to-peer networking technology has received much attention from researchers and developers. In this paper, we propose a new scheme for scalable and robust video streaming on P2P networks. Our scheme constructs hierarchical distribution trees from peers and considers the physical structure of underlying hierarchically organized networks, such as an enterprise network. A centric server manages the construction of a higher-level tree among branches, but lower-level trees are built through local communication among peers. Peers recover from faults by themselves, using partial information they have. Through simulation and practical experiments, we verified that our scheme can provide thousands or ten thousands of users with continuous video streaming services on an unreliable P2P network.

2006

Multimedia contents are distributed to peers in various ways in peer-to-peer (P2P) overlay networks. A peer which holds a content, even a part of a content can provide other peers with the content. Multimedia streaming is more significant in multimedia applications than downloading ways in Internet applications. We discuss how to support peers with multimedia streaming service by using multiple contents peers. In our distributed multi-source streaming model, a collection of multiple contents peers in parallel transmit packets of a multimedia content to a requesting leaf peer to realize the reliability and scalability without any centralized controller. Even if some peer stops by fault and is degraded in performance and packets are lost and delayed in networks, a requesting leaf peer receives every data of a content at the required rate. We discuss a pair of flooding-based protocols, distributed and tree-based coordination protocols DCoP and TCoP, to synchronize multiple contents peers to reliably and efficiently deliver packets to a requesting peer. A peer can be redundantly selected by multiple peers in DCoP but it taken by at most one peer in TCoP. We evaluate the protocols in terms of how long it takes and how many messages are transmitted to synchronize multiple contents peers.

Lecture Notes in Computer Science, 2003

A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content over peer-to-peer network. We focus on two problems in peer-to-peer media content distribution systems. The first is the transmission scheduling of the media data for a multi-source streaming session. We present a sophisticated scheduling scheme, which results in minimum buffering delay. The second problem is on the fast distribution of media content in the peer-to-peer system that is self-growing. We propose a mechanism accelerating the speed at which the system's streaming capacity increases.

Image Processing (ICIP), …, 2009

Peer-to-peer (P2P) video streaming is a promising method for multimedia distribution over the Internet, yet many problems remain to be solved such as providing the best quality of service to each peer in proportion to its available resources, low-delay, and fault tolerance. In this paper, we propose a new bandwidth-aware multiple multicast tree formation procedure built on top of a hierarchical cluster based P2P overlay architecture for scalable video (SVC) streaming. The tree formation procedure considers number of sources, SVC layer rates available at each source, as well as delay and available bandwidth over links in an attempt to maximize the quality of received video at each peer. Simulations are performed on NS2 with 500 nodes to demonstrate that the overall performance of the system in terms of average received video quality of all peers is significantly better if peers with higher available bandwidth are placed higher up in the trees and peers with lower bandwidth are near the leaves.

2

Eighth IEEE International Symposium on Multimedia (ISM'06), 2006

A multimedia contents are distributed to peers and a contents peer which holds contents can provide other peers with the contents in peer-to-peer (P2P) overlay networks. Multimedia streaming is more significant than downloading ways in multimedia applications from security and economical reasons. We discuss distributed multi-source streaming models. Here, a collection of multiple contents peers in parallel transmit packets of a multimedia content to a leaf peer to realize the reliability and scalability. Even if not only some number of peers stop by fault and are degraded in performance but also some number of packets are lost and delayed, a leaf peer can receive a content at the required rate. We discuss how to allocate packets to each contents peer. We discuss a gossipbased, DAG-based coordination protocol (DCoP) to synchronize multiple contents peers. We evaluate DCoP in terms of how long it takes and how many messages are transmitted to synchronize multiple contents peers.

Multimedia Systems, 2005

We presellt the design. implementation. and evulmllion of a novel P2P service called Cof!c'rrCasr. Cul-Jcl',CaS[ ()rCra(e.~cllIire!)' :It the application level but infers amI exploits propenies of the um.lcrlying network,

2005

In this paper we propose a rate-efficient peer-to-peer architecture for video multicasting over the Internet. The limited capacity of the Internet hosts and the heterogeneous property of their access links are the main challenges of the peer-to-peer video multicasting over the Internet. Although, the rate-optimized overlay tree construction is a NP-hard problem, we propose a number of distributed and efficient protocols for rate-efficient overlay tree construction. Our proposed protocols include efficient join, improvement, overlay tree refinement and an optimum rate allocation protocol. The simulation results show the efficiency of the proposed protocols in rate-efficient overlay tree construction. We show that through combination of the efficient join protocol, tree refinement operations and an optimum rate allocation algorithm we can achieve a suboptimum overlay tree.

Computer Standards & Interfaces, 2017

In this study, a novel overlay architecture for constructing hierarchical and scalable clustering of Peer-to-Peer (P2P) networks is proposed. The proposed architecture attempts to enhance the clustering of peers by incorporating join, split, merge and cluster leader election mechanisms in a fully distributed manner. It takes delay proximity of peers into account as distance measure. By constructing hierarchical clustering of peers, the control message overhead and maintenance such as host departure/host join overhead are decreased. Theoretical comparisons on overheads of the proposed system with that of other systems from literature are studied. The control mechanism for dynamic peer behaviour of the architecture is tested over PlanetLab. The performance metrics used are end-to-end delay, diameter, cluster head distance, occupancy rate, peer join latency, accuracy and correctness. The test results are compared with Hierarchical Ring Tree (HRT) and mOverlay architecture. In addition, a P2P video streaming application is run over the proposed network overlay. Streaming tests show that video streaming applications perform well in terms of received video quality if hierarchical clusters considering delay proximity are used as underlying network architecture.