Survey: Research on QoS of P2P Reliable Streaming Media
---
paper_title: Hybrid streaming media distribution model based on P2P and CDN

paper_content:

Based on CDN and P2P, this paper provided a new HSDM. According to the relation of peers and streaming capacity in the system, realized and then simulated the hybrid model. The result shows that compared with traditional CDN and P2P, this new hybrid model obviously reduces the flow of backbone network. And also, with this new method can effectively reduce the pressure of CDN severs and the response time of system without compromising the media quality delivered, and increases the network utilization.
---
paper_title: Research and Evolvement of Key Technologies Enhancing Practicability of P2P Network

paper_content:

P2P network is a new technology specially promoted by needs of application.Enhancing practicability is a main thread of P2P research.Surveys types of P2P application,summarizes the property model of P2P network and analyzes key technologies affecting practicability of P2P network including topology parameter optimizing of structured P2P,topology awareness of overly,heterogeneous and load balancing,enhancing churn resistibility,fault tolerance and incentive mechanism.Classifies and compares solutions of key problems and discusses directions of research based on the comparing result.
---
paper_title: Accelerating Internet streaming media delivery using network-aware partial caching

paper_content:

Internet streaming applications are affected by adverse network conditions such as high packet loss rates and long delays. This paper aims at mitigating such effects by leveraging the availability of client-side caching proxies. We present a novel caching architecture and associated cache management algorithms that turn edge caches into accelerators of streaming media delivery. A salient feature of our caching algorithms is that they allow partial caching of streaming media objects and joint delivery of content from caches and origin servers. The caching algorithms we propose are both network-aware and stream-aware; they take into account the popularity of streaming media objects, their bit-rate requirements, and the available bandwidth between clients and servers. Using realistic models of Internet bandwidth derived from proxy cache logs and measured over real Internet paths, we have conducted simulations to evaluate the performance of various cache management alternatives. Our experiments demonstrate that network-aware caching algorithms can significantly reduce service delay and improve overall stream quality. Our experiments also show that partial caching is particularly effective when bandwidth variability is not very high.
---
paper_title: A peer-to-peer on-demand streaming service and its performance evaluation

paper_content:

Providing on-demand video streaming service over the Internet is a challenging task. In this paper, we propose DirectStream, a directory based peer-to-peer video streaming service that efficiently and cost-effectively provides video on-demand service with VCR operation support. We analytically and experimentally examine the system performance, and show that the proposed scheme can significantly reduce the workload posed on the server, and that it scales extremely well as the popularity of the video increases even if participating clients behave non-cooperatively. We propose a QoS parent selection algorithm to construct the appropriate peer-to-peer networks, and discuss how to provide continuous playback in the face of clients' early departures. Our study suggests that peer-to-peer networking is a promising technique to address scalability in on-demand streaming service.
---
paper_title: P2Cast: peer-to-peer patching scheme for VoD service

paper_content:

Providing video on demand (VoD) service over the Internet in a scalable way is a challenging problem. In this paper, we propose P2Cast - an architecture that uses a peer-to-peer approach to cooperatively stream video using patching techniques, while only relying on unicast connections among peers. We address the following two key technical issues in P2Cast: (1) constructing an application overlay appropriate for streaming; and (2) providing continuous stream playback (without glitches) in the face of disruption from an early departing client. Our simulation experiments show that P2Cast can serve many more clients than traditional client-server unicast service, and that it generally out-performs multicast-based patching if clients can cache more than of a stream's initial portion. We handle disruptions by delaying the start of playback and applying the shifted forwarding technique. A threshold on the length of time during which arriving clients are served in a single session in P2Cast serves as a knob to adjust the balance between the scalability and the clients' viewing quality in P2Cast.
---
paper_title: GnuStream: a P2P media streaming system prototype

paper_content:

We present the design and prototype of GnuStream, a peer- to-peer (P2P) and receiver-driven media streaming system. GnuStream is built on top of Gnutella, and it integrates dynamic peer location and streaming capacity aggregation. Each GnuStream streaming session is controlled by the receiver peer and involves a dynamic set of peer senders instead of one fixed sender. The receiver aggregates streaming bandwidth from the multiple senders, achieving load distribution and fast reaction to sender capacity and on/off-line status changes. The effectiveness of GnuStream is demonstrated by our experiments with its prototype, which serves as the basis for real-world development and evaluation of resilient P2P media streaming services.
---
paper_title: SCRIBE: The design of a large-scale event notification infrastructure

paper_content:

This paper presents Scribe, a large-scale event notification infrastructure for topic-based publish-subscribe applications. Scribe supports large numbers of topics, with a potentially large number of subscribers per topic. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry's reliability, self-organization and locality properties. Pastryi s used to create a topic (group) and to build an efficient multicast tree for the dissemination of events to the topic's subscribers (members). Scribe provides weak reliability guarantees, but we outline how an application can extend Scribe to provide stronger ones.
---
paper_title: On-demand media streaming over the Internet

paper_content:

We propose a new model for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The proposed P2P model can support a large number of clients with a low overall system cost. The P2P model allows for peers to share some of their resources with the system and in return, they get some incentives or rewards. We describe how to realize (or deploy) the proposed model. In addition, we present a new dispersion algorithm (for disseminating the media files into the system) and a searching algorithm (for locating peers with the required objects). We demonstrate the potential of the P2P model as an infrastructure for a large-scale on-demand media streaming service through an extensive simulation study on large, Internet-like, topologies. Starting with a limited streaming capacity (hence, low cost), the simulation shows that the capacity is rapidly increased and many clients can be served even if they come according to different arrival patterns such as constant rate arrivals, flash crowd arrivals, and Poisson arrivals.
---
paper_title: P2Cast: peer-to-peer patching scheme for VoD service

paper_content:

Providing video on demand (VoD) service over the Internet in a scalable way is a challenging problem. In this paper, we propose P2Cast - an architecture that uses a peer-to-peer approach to cooperatively stream video using patching techniques, while only relying on unicast connections among peers. We address the following two key technical issues in P2Cast: (1) constructing an application overlay appropriate for streaming; and (2) providing continuous stream playback (without glitches) in the face of disruption from an early departing client. Our simulation experiments show that P2Cast can serve many more clients than traditional client-server unicast service, and that it generally out-performs multicast-based patching if clients can cache more than of a stream's initial portion. We handle disruptions by delaying the start of playback and applying the shifted forwarding technique. A threshold on the length of time during which arriving clients are served in a single session in P2Cast serves as a knob to adjust the balance between the scalability and the clients' viewing quality in P2Cast.
---
paper_title: A peer-to-peer on-demand streaming service and its performance evaluation

paper_content:

Providing on-demand video streaming service over the Internet is a challenging task. In this paper, we propose DirectStream, a directory based peer-to-peer video streaming service that efficiently and cost-effectively provides video on-demand service with VCR operation support. We analytically and experimentally examine the system performance, and show that the proposed scheme can significantly reduce the workload posed on the server, and that it scales extremely well as the popularity of the video increases even if participating clients behave non-cooperatively. We propose a QoS parent selection algorithm to construct the appropriate peer-to-peer networks, and discuss how to provide continuous playback in the face of clients' early departures. Our study suggests that peer-to-peer networking is a promising technique to address scalability in on-demand streaming service.
---
paper_title: An Architecture for Highly Available Wide-Area Service Composition

paper_content:

Service composition provides a flexible way to quickly enable new application functionalities in next generation networks. We focus on the scenario where next generation portal providers 'compose' the component services of other providers. We have developed an architecture based on an overlay network of service clusters to provide failure-resilient composition of services across the wide-area Internet: our algorithms detect and recover quickly from failures in composed client sessions. In this paper, we present an evaluation of our architecture whose overarching goal is quick recovery of client sessions. The evaluation of an Internet-scale system like ours is challenging. Simulations do not capture true workload conditions and Internet-wide deployments are often infeasible. We have developed an emulation platform for our evaluation-one that allows a realistic and controlled design study. Our experiments show that the control overhead involved in implementing our recovery mechanism is minimal in terms of network as well as processor resources; minimal additional provisioning is required for this. Failure recovery can be effected using alternate service replicas within about 1 s after failure detection on Internet paths. We collect trace data to show that failure detection itself can be tight on wide-area Internet paths-within about 1.8 s. Failure detection and recovery within these time bounds represents a significant improvement over existing Internet path recovery mechanisms that take several tens of seconds to a few minutes.
---
paper_title: P2VoD: providing fault tolerant video-on-demand streaming in peer-to-peer environment

paper_content:

We present a system for video-on-demand streaming in peer-to-peer environment. We start by realizing the major differences between two types of streaming: live and on-demand. These observations lead to a set of problems that need to be solved for a peer-to-peer video-on-demand system. To address these problems, we propose a solution, which includes detail algorithms for building and maintaining an application multicast tree. The novel ideas in this paper are the use of a new caching scheme at clients, and the introduction of generation for better client management. Performance study based on simulation is carried out. The results show that our system outperforms a recently proposed system in a number of important performance metrics.
---
paper_title: Proxy caching algorithm based on segment popularity for mobile streaming media

paper_content:

A novel dynamic scheduling algorithm P2CAS2M2(proxy caching algorithm based on segment popularity for mobile streaming media)based on segment popularity for mobile streaming media was proposed.Proxy caching admis-sion and replacement algorithm based on the object segment popularity for mobile streaming media was implemented.The principle was obeyed that the data cached for each mobile streaming media object were in proportion to their popu-larity at the proxy server.The cache window size was updated periodically according to the average access time of the clients.Simulation results show that this algorithm is more adaptive than A2LS(adaptive and lazy segmentation algorithm) for the variety of the proxy server cache.It can gain more average number of cached mobile streaming media objects and less delayed requested ratio while byte-hit ratio of P2CAS2M2 is close to or exceeds A2LS under the circumstance of the same proxy cache space.
---
paper_title: Research on Churn Problem in P2P Networks

paper_content:

Churn is one of the main problems faced by all P2P networks.This paper surveys the existing theories and methods about Churn.On the basis of the generation mechanism of Churn,this study summarizes the major steps of the Churn problem solution:precise measurement of Churn,analysis of the impact of Churn on P2P performance,and provision of specific strategies to handle Churn.Under each step,existing problems,solutions,and the newest recent research are explored.This paper also discusses the prospects of future studies.
---
paper_title: On-demand media streaming over the Internet

paper_content:

We propose a new model for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The proposed P2P model can support a large number of clients with a low overall system cost. The P2P model allows for peers to share some of their resources with the system and in return, they get some incentives or rewards. We describe how to realize (or deploy) the proposed model. In addition, we present a new dispersion algorithm (for disseminating the media files into the system) and a searching algorithm (for locating peers with the required objects). We demonstrate the potential of the P2P model as an infrastructure for a large-scale on-demand media streaming service through an extensive simulation study on large, Internet-like, topologies. Starting with a limited streaming capacity (hence, low cost), the simulation shows that the capacity is rapidly increased and many clients can be served even if they come according to different arrival patterns such as constant rate arrivals, flash crowd arrivals, and Poisson arrivals.
---
paper_title: P2Cast: peer-to-peer patching scheme for VoD service

paper_content:

Providing video on demand (VoD) service over the Internet in a scalable way is a challenging problem. In this paper, we propose P2Cast - an architecture that uses a peer-to-peer approach to cooperatively stream video using patching techniques, while only relying on unicast connections among peers. We address the following two key technical issues in P2Cast: (1) constructing an application overlay appropriate for streaming; and (2) providing continuous stream playback (without glitches) in the face of disruption from an early departing client. Our simulation experiments show that P2Cast can serve many more clients than traditional client-server unicast service, and that it generally out-performs multicast-based patching if clients can cache more than of a stream's initial portion. We handle disruptions by delaying the start of playback and applying the shifted forwarding technique. A threshold on the length of time during which arriving clients are served in a single session in P2Cast serves as a knob to adjust the balance between the scalability and the clients' viewing quality in P2Cast.
---
paper_title: P2P-Based Video-on-Demand Systems:A Survey

paper_content:

Over the past decade,peer-to-peer (P2P) based video-on-demand (VoD) systems have received a tremendous amount of attention.They are immensely attractive because of their cheap deployment and high scalability compared to traditional Client/Server (C/S) based VoD systems.However,due to the instability and heterogeneity of P2P networks,there are many challenges in designing,implementing,and deploying such systems.For instance,the lack of resources (e.g.,source nodes,bandwidth,storage,etc.) usually becomes a barrier that prevents practical systems from normal operation.Based on the observation,this paper outlines the components of existing VoD/P2P architectures and surveys approaches to their design,focusing on how to make full use of limited resources in P2P based VoD systems.Specifically,the authors present a survey in three aspects:(1) data transmission,referring to how to make full use of nodes' bandwidth;(2) data storage,referring to how to make full use of nodes' storage;and (3) incentive mechanisms that stimulate nodes to contribute more resources.
---
paper_title: Incentives build robustness in BitTorrent

paper_content:

The BitTorrent file distribution system uses tit-fortat as a method of seeking pareto efficiency. It achieves a higher level of robustness and resource utilization than any currently known cooperative technique. We explain what BitTorrent does, and how economic methods are used to achieve that goal. 1 What BitTorrent Does When a file is made available using HTTP, all upload cost is placed on the hosting machine. With BitTorrent, when multiple people are downloading the same file at the same time, they upload pieces of the file to each other. This redistributes the cost of upload to downloaders, (where it is often not even metered), thus making hosting a file with a potentially unlimited number of downloaders affordable. Researchers have attempted to find practical techniqes to do this before[3]. It has not been previously deployed on a large scale because the logistical and robustness problems are quite difficult. Simply figuring out which peers have what parts of the file and where they should be sent is difficult to do without incurring a huge overhead. In addition, real deployments experience very high churn rates. Peers rarely connect for more than a few hours, and frequently for only a few minutes [4]. Finally, there is a general problem of fairness [1]. The total download rate across all downloaders must, of mathematical necessity, be equal to the total upload rate. The strategy for allocating upload which seems most likely to make peers happy with their download rates is to make each peer’s download rate be proportional to their upload rate. In practice it’s very difficult to keep peer download rates from sometimes dropping to zero by chance, much less make upload and download rates be correlated. We will explain how BitTorrent solves all of these problems well. 1.1 BitTorrent Interface BitTorrent’s interface is almost the simplest possible. Users launch it by clicking on a hyperlink to the file they wish to download, and are given a standard “Save As” dialog, followed by a download progress dialog which is mostly notable for having an upload rate in addition to a download rate. This extreme ease of use has contributed greatly to BitTorrent’s adoption, and may even be more important than, although it certainly complements, the performance and cost redistribution features which are described in this paper.
---
paper_title: P2P-Based Video-on-Demand Systems:A Survey

paper_content:

Over the past decade,peer-to-peer (P2P) based video-on-demand (VoD) systems have received a tremendous amount of attention.They are immensely attractive because of their cheap deployment and high scalability compared to traditional Client/Server (C/S) based VoD systems.However,due to the instability and heterogeneity of P2P networks,there are many challenges in designing,implementing,and deploying such systems.For instance,the lack of resources (e.g.,source nodes,bandwidth,storage,etc.) usually becomes a barrier that prevents practical systems from normal operation.Based on the observation,this paper outlines the components of existing VoD/P2P architectures and surveys approaches to their design,focusing on how to make full use of limited resources in P2P based VoD systems.Specifically,the authors present a survey in three aspects:(1) data transmission,referring to how to make full use of nodes' bandwidth;(2) data storage,referring to how to make full use of nodes' storage;and (3) incentive mechanisms that stimulate nodes to contribute more resources.
---

Title: Survey: Research on QoS of P2P Reliable Streaming Media
Section 1: INTRODUCTION
Description 1: Provide an overview of the importance of large-scale media streaming technology and the limitations of traditional methods. Introduce P2P technology as a solution and highlight its benefits and challenges, particularly in the context of QoS for streaming media.

Section 2: Typical flow service strategy
Description 2: Discuss the various service strategies for web-based streaming media systems, including C/S mode unicast, IP multicast mode, agent-based distribution, CDN services, P2P streaming systems, and PeerCDN mode. Highlight their advantages and disadvantages.

Section 3: P2P Streaming System Status
Description 3: Detail the current state of P2P streaming systems, dividing them into single tree distribution, multi-tree distribution, and mesh topology. Discuss examples and typical structures, as well as the challenges and solutions associated with each.

Section 4: RESEARCH ON QOS IN P2P STREAMING MEDIA
Description 4: Explain the key indicators for measuring QoS in P2P streaming media systems, such as bandwidth, delay, and jitter. Discuss the challenges of ensuring high service quality in P2P networks and current research efforts to address these issues.

Section 5: Reputation Mechanism
Description 5: Describe various reputation mechanisms used to assess the credibility of nodes in P2P networks, including local and global reputation models. Highlight their importance in selecting reliable nodes and maintaining high QoS.

Section 6: Peer Selection Mechanism
Description 6: Discuss mechanisms for selecting optimal nodes in P2P networks to ensure stability, high bandwidth, and low latency. Explain how good network topology can improve QoS.

Section 7: Copy Strategy
Description 7: Describe strategies for using copies to enhance fault tolerance and reduce network jitter. Discuss different caching and replacement algorithms to maintain the continuity of streaming media services.

Section 8: Incentive Mechanism
Description 8: Outline incentive mechanisms designed to encourage nodes to contribute more to P2P networks, addressing issues like free-riding. Discuss various approaches, including virtual currency and asymmetric TFT.

Section 9: FURTHER RESEARCH
Description 9: Highlight areas for future research in improving QoS in P2P streaming media, such as better reputation models, minimizing network jitter, advanced caching strategies, and more effective incentive mechanisms.

Section 10: CONCLUSION
Description 10: Summarize the importance of QoS in P2P streaming media, review the strategies discussed in the paper, and reiterate the significance of ongoing research to enhance streaming service quality.