On peer-to-peer media streaming

IEEE Journal on Selected Areas in Communications, 2004

Given the fact that the current Internet does not widely support IP Multicast while content-distribution-networks technologies are costly, the concept of peer-to-peer could be a promising start for enabling large-scale streaming systems. In our so-called Zigzag approach, we propose a method for clustering peers into a hierarchy called the administrative organization for easy management, and a method for building the multicast tree atop this hierarchy for efficient content transmission. In Zigzag, the multicast tree has a height logarithmic with the number of clients, and a node degree bounded by a constant. This helps reduce the number of processing hops on the delivery path to a client while avoiding network bottleneck. Consequently, the end-to-end delay is kept small. Although one could build a tree satisfying such properties easily, an efficient control protocol between the nodes must be in place to maintain the tree under the effects of network dynamics. Zigzag handles such situations gracefully requiring a constant amortized worst-case control overhead. Especially, failure recovery is done regionally with impact on at most a constant number of existing clients and with mostly no burden on the server.

International Journal of Engineering Research and Technology (IJERT), 2014

https://www.ijert.org/study-and-analysis-on-optimal-scheduling-data-driven-peer-to-peer-streaming https://www.ijert.org/research/study-and-analysis-on-optimal-scheduling-data-driven-peer-to-peer-streaming-IJERTV1IS6197.pdf We propose a new architecture for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The key idea of the architecture is that peers share some of their resources with the system. As peers contribute resources to the system, the overall system capacity increases and more clients can be served.. In these applications, each node independently selects some other nodes as its neighbors (i.e., gossip style overlay construction) and exchanges streaming data with the neighbors (i.e., data scheduling). To improve the performance of such protocol, many existing works focus on the gossip-style overlay construction issue. However, few of them concentrate on optimizing the streaming data scheduling to maximize the throughput of a constructed overlay. In this paper, we analytically study the scheduling problem in data-driven streaming system and model it as a classical min-cost network flow problem. We then propose both the global optimal scheduling scheme and distributed heuristic algorithm to optimize the system throughput. Furthermore, we introduce layered video coding into data-driven protocol and extend our algorithm to deal with the end-host heterogeneity.

European Transactions on Telecommunications, 2004

With the growth of computing power and the proliferation of broadband access to the internet, the use of media streaming has become widely diffused. By using the peer-to-peer (P2P) communication architecture, media streaming can be expected to smoothly react to changes in network conditions and user demands for media streams. In this paper, to achieve continuous and scalable media streaming, we introduce our scalable media search and in-time retrieval methods. Through several simulation experiments, we show that our methods can accomplish continuous media play-out for popular media streams without introducing extra load on the system. However, we also show that an LRU cache replacement algorithm cannot provide users with continuous media play-out for unpopular media streams. To tackle this problem, we take inspiration from biological systems to propose a new cache replacement algorithm that considers the balance between supply and demand for media streams. We demonstrate that our proposed algorithm can improve the continuity of media play-out compared with LRU. Furthermore, we find that the proposed algorithm can adapt to changes in the popularity of various media.

2

2003

Abstract In this paper, we propose a peer-to-peer streaming solution to address the on-demand media distribution problem. We identify two issues, namely the asynchrony of user requests and heterogeneity of peer network bandwidth. Our key techniques to address these two issues are cache-and-relay and layer-encoded streaming.

19Th International Conference on Advanced Information Networking and Applications Volume 1, 2005

A peer-to-peer (P2P) network is composed of large number of peer computers which are cooperating by exchanging messages in networks. In multimedia streaming applications, multimedia data is required to be efficiently and reliably delivered to processes in a real-time manner. In order to support scalable and reliable multimedia streaming service, we newly discuss a multi-source streaming way where multiple source peers transmit packets of multimedia content to each peer. Here, each of the source peers transmits different packets with some redundancy to the peer in order to be tolerant of some number of faulty peers and packets lost.

2009 17th International Workshop on Quality of Service, 2009

We study streaming of scalable videos over peer-topeer (P2P) networks. We focus on efficient management of seed servers resources, which need to be deployed in the network to make up for the limited upload capacity of peers in order to deliver higher quality video streams. These servers have finite serving capacity and are often loaded with a volume of requests larger than their capacity. We formulate the problem of allocating this capacity for optimally serving scalable videos. We show that this problem is NP-complete, and propose two approximation algorithms to solve it. The first one allocates seeding resources for serving peers based on dynamic programming, and is more suitable for small seeding capacities (≤ 10 Mbps). The second algorithm follows a greedy approach and is more efficient for larger capacities. We evaluate the proposed algorithms analytically and in a simulated P2P streaming system. The results confirm the efficiency and near-optimality of the proposed algorithms, and show that higher-quality videos are delivered to peers if our algorithms are employed for allocating seed servers.

2002

We design a peer-to-peer technique called ZIGZAG for single-source media streaming. ZIGZAG allows the media server to distribute content to many clients by organizing them into an appropriate tree rooted at the server. This applicationlayer multicast tree has a height logarithmic with the number of clients and a node degree bounded by a constant. This helps reduce the number of processing hops on the delivery path to a client while avoiding network bottleneck. Consequently, the end-to-end delay is kept small. Although one could build a tree satisfying such properties easily, an efficient control protocol between the nodes must be in place to maintain the tree under the effects of network dynamics and unpredictable client behaviors. ZIGZAG handles such situations gracefully requiring a constant amortized control overhead. Especially, failure recovery can be done regionally with little impact on the existing clients and mostly no burden on the server. 0-7803-7753-2/03/$17.00 (C)

Conferência sobre Redes de Computadores, Universidade do Minho, Braga, Portugal, 2010

Abstract—The combination of Scalable Video Coding and Peerto-Peer networks is a potential area of innovation in terms of video streaming on the Internet. Applications for sharing files, such as BitTorrent, have been broadly developed and nowadays they cater for the majority of the Internet traffic, adding the need for the exploration of real-time streaming services based on these networks. Several Peer-to-Peer streaming techniques have been deployed, but very few explore bandwidth adaptation, support of diverse terminal and ...

ACM Transactions on Multimedia Computing, Communications, and Applications, 2005

Recent research efforts have demonstrated the great potential of building cost-effective media streaming systems on top of peer-to-peer (P2P) networks. A P2P media streaming architecture can reach a large streaming capacity that is difficult to achieve in conventional server-based streaming services. Hybrid streaming systems that combine the use of dedicated streaming servers and P2P networks were proposed to build on the advantages of both paradigms. However, the dynamics of such systems and the impact of various factors on system behavior are not totally clear. In this paper, we present an analytical framework to quantitatively study the features of a hybrid media streaming model. Based on this framework, we derive an equation to describe the capacity growth of a single-file streaming system. We then extend the analysis to multi-file scenarios. We also show how the system achieves optimal allocation of server bandwidth among different media objects. The unpredictable departure/failure of peers is a critical factor that affects the performance of P2P systems. We utilize the concept of peer lifespan to model peer failures. The original capacity growth equation is enhanced with coefficients generated from peer lifespans that follow an exponential distribution. We also propose a failure model under arbitrarily distributed peer lifespan. Results from large-scale simulations support our analysis.