Closest playback-point first: A new peer selection algorithm for P2P VoD systems

Peer-to-peer (P2P) based video-on-demand (VoD) streaming service has been gaining popularity recently. Unlike live streaming, a VoD peer always starts its playback from the beginning of a stored video. The playback-points of different peers, as well as the amount of video contents/pieces they cached, depend on when they join the video session, or their viewing ages. As a result, the upload bandwidth of younger peers tends to be underutilized because older peers are not interested in their cached video pieces. The collaborative piece exchange among peers is undermined due to the unbalanced supply and demand. To address this issue, a playback-point based request peer selection algorithm is proposed in this paper. Specifically, when a peer requests a particular video piece, among the set of potential providers, a request is sent to the peer that has the smallest playback-point difference with itself. We call this request peer selection algorithm closest playback-point first (CPF). With CPF, peers with similar available content can be loosely grouped together for a more balanced collaborative piece exchange. Extensive packet-level simulations show that with CPF, the video playback quality is enhanced and the VoD server load is significantly reduced. © 2011 IEEE.published_or_final_versionThe IEEE Global Telecommunications Conference (GLOBECOM 2011), Houston, TX, USA, 5-9 December 201

Strategies of collaboration in multi-channel P2P VoD streaming

As compared to live peer-to-peer (P2P) streaming, modern P2P video-on-demand (VoD) systems have brought much larger volumes of videos and more interactive controls to the Internet users. Nevertheless, the larger number of available videos and the flexibility of allowing users to jump back and forth in a video, have led to much fewer numbers of concurrent peers watching at a similar pace, that reduces the chance for collaborative chunk supply among peers and thus significantly increases the server bandwidth cost [1]. Towards the ultimate goal of maximizing peer resource utilization, in this paper, we design effective strategies for both cross-channel and intra-channel collaborations in multi-channel P2P VoD systems, such that individual peer's resources, including download/upload bandwidths and the cache capacity, are effectively utilized to maximize the streaming qualities in all the channels. In particular, each peer actively and strategically determines the supply-and-demand imbalance in different channels, as well as that among different chunks within each video, makes use of its surplus download capacity to fetch chunks with the most need, and then serves those chunks using its idle upload bandwidth, all without impairing its own streaming quality. Our extensive trace-driven simulations show the effectiveness of our strategies in reducing the server cost while guaranteeing high streaming qualities in the entire system, even during extreme scenarios such as unexpected flash crowds. ©2010 IEEE.published_or_final_versionThe IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM 2010), Miami, FL., 6-10 December 2010. In Proceedings of GLOBECOM, 2010, p. 1-

System analysis of a Peer-to-Peer Video-on-Demand architecture : Kangaroo

Architectural design and deployment of Peer-to-Peer Video-on-Demand (P2PVoD) systems which support VCR functionalities is attracting the interest of an increasing number of research groups within the scientific community; especially due to the intrinsic characteristics of such systems and the benefits that peers could provide at reducing the server load. This work focuses on the performance analysis of a P2P-VoD system considering user behaviors obtained from real traces together with other synthetic user patterns. The experiments performed show that it is feasible to achieve a performance close to the best possible. Future work will consider monitoring the physical characteristics of the network in order to improve the design of different aspects of a VoD system.El disseny arquitectònic i el desplegament de sistemes de Vídeo sota Demanda "Peer-to-Peer" que soporten funcionalitats VCR està captant l'interès d'un nombre creixent de grups de recerca a la comunitat científica, degut especialment a les característiques intrínsiques dels mencionats sistemes i als beneficis que els peers podrien proporcionar a la reducció de la càrrega en el servidor. Aquest treball tracta l'anàlisi del rendiment d'un sistema P2P-VoD considerant el comportament d'usuaris obtingut amb traçes reals i amb patrons sintètics. Els experiments realitzats mostren que és viable assolir un rendiment proper al cas més óptim. Com treball futur es considerarà la monitorització de les característiques físiques de la xarxa per a poder millorar el disseny dels diferents aspectes que formen un sistema de VoD.El diseño arquitectónico y el despliegue de sistemas de Video bajo Demanda "Peer-to-Peer" que soportan funcionalidades VCR está captando el interés de un número creciente de grupos de investigación dentro de la comunidad científica; especialmente debido a las características intrínsecas de tales sistemas y a los beneficios que los peers podrían proporcionar en la reducción de la carga en el servidor. Este trabajo se enfoca en el análisis de rendimiento de un sistema P2PVoD considerando el comportamiento de usuarios obtenido de trazas reales, junto a otros patrones sintéticos. Los experimentos realizados muestran que es viable lograr un rendimiento cercano al caso más óptimo. El trabajo futuro considerará la monitorización de las características físicas de la red para poder mejorar el diseño de los diferentes aspectos que conforman un sistema de VoD

Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms

We analyze a distributed system where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less. We explore under which conditions such a system can be scalable while serving any sequence of demands. We model this problem through a combination of two algorithms: a video allocation algorithm and a connection scheduling algorithm. The latter plays against an adversary that incrementally proposes video requests

Video-on-Demand over Internet: a survey of existing systems and solutions

Video-on-Demand is a service where movies are delivered to distributed users with low delay and free interactivity. The traditional client/server architecture experiences scalability issues to provide video streaming services, so there have been many proposals of systems, mostly based on a peer-to-peer or on a hybrid server/peer-to-peer solution, to solve this issue. This work presents a survey of the currently existing or proposed systems and solutions, based upon a subset of representative systems, and defines selection criteria allowing to classify these systems. These criteria are based on common questions such as, for example, is it video-on-demand or live streaming, is the architecture based on content delivery network, peer-to-peer or both, is the delivery overlay tree-based or mesh-based, is the system push-based or pull-based, single-stream or multi-streams, does it use data coding, and how do the clients choose their peers. Representative systems are briefly described to give a summarized overview of the proposed solutions, and four ones are analyzed in details. Finally, it is attempted to evaluate the most promising solutions for future experiments. Résumé La vidéo à la demande est un service où des films sont fournis à distance aux utilisateurs avec u

Modeling and analysis of P2P streaming.

Zhou, Yipeng.Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.Includes bibliographical references (leaves 64-66).Abstracts in English and Chinese.Abstract --- p.iAcknowledgement --- p.ivChapter 1 --- Introduction --- p.1Chapter 1.1 --- Background --- p.1Chapter 1.2 --- Contribution --- p.2Chapter 1.3 --- Organization --- p.4Chapter 2 --- Related Work --- p.5Chapter 2.1 --- Work of Streaming --- p.5Chapter 2.2 --- Work of P2P VoD --- p.6Chapter 3 --- Basic Model of Synchronized Case --- p.8Chapter 4 --- Model of Chunk Selection Strategies --- p.13Chapter 4.1 --- Chunk Selection Strategies --- p.13Chapter 4.1.1 --- Greedy Strategy --- p.14Chapter 4.1.2 --- Rarest First Strategy --- p.15Chapter 4.1.3 --- "Buffer Size, Peer Population and Continuity" --- p.16Chapter 4.1.4 --- Mixed Strategy --- p.17Chapter 4.2 --- Some Conclusion and Extension --- p.19Chapter 4.3 --- Metrics --- p.20Chapter 4.3.1 --- Continuity --- p.20Chapter 4.3.2 --- Start-up Latency --- p.20Chapter 5 --- Experiment and Application --- p.22Chapter 5.1 --- Numerical Examples and Analysis --- p.22Chapter 5.2 --- Sensitivity study --- p.30Chapter 5.2.1 --- Discrete Model with Factor --- p.30Chapter 5.2.2 --- Validate Discrete Model with Factor --- p.31Chapter 5.2.3 --- Server Use Pull Strategy --- p.31Chapter 5.2.4 --- Vary Subset Size Touched by Server --- p.32Chapter 5.3 --- Application to Real-world Protocols --- p.32Chapter 6 --- Model of Unsynchronized Case --- p.34Chapter 6.1 --- The model for unsynchronized playback --- p.34Chapter 6.1.1 --- Overlap maximization problem --- p.37Chapter 6.1.2 --- Properties of the synchronized cluster --- p.38Chapter 6.2 --- Analysis of playback continuity --- p.40Chapter 6.2.1 --- Peers with different buffer sizes --- p.41Chapter 6.2.2 --- Analysis of two clusters with a lag --- p.44Chapter 7 --- Performance Evaluation of Unsynchronized System --- p.48Chapter 7.1 --- Performance Evaluation --- p.48Chapter 8 --- conclusion --- p.54Chapter 8.1 --- Conclusion --- p.54Chapter A --- Equation Derivation --- p.56Bibliography --- p.6

Efficient Range and Join Query Processing in Massively Distributed Peer-to-Peer Networks

Peer-to-peer (P2P) has become a modern distributed computing architecture that supports massively large-scale data management and query processing. Complex query operators such as range operator and join operator are needed by various distributed applications, including content distribution, locality-aware services, computing resource sharing, and many others. This dissertation tackles a number of problems related to range and join query processing in P2P systems: fault-tolerant range query processing under structured P2P architecture, distributed range caching under unstructured P2P architecture, and integration of heterogeneous data under unstructured P2P architecture. To support fault-tolerant range query processing so as to provide strong performance guarantees in the presence of network churn, effective replication schemes are developed at either the overlay network level or the query processing level. To facilitate range query processing, a prefetch-based caching approach is proposed to eliminate the performance bottlenecks incurred by those data items that are not well cached in the network. Finally, a purely decentralized partition-based join query operator is devised to realize bandwidth-efficient join query processing under unstructured P2P architecture. Theoretical analysis and experimental simulations demonstrate the effectiveness of the proposed approaches

OpenCache:a content delivery platform for the modern internet

Since its inception, the World Wide Web has revolutionised the way we share information, keep in touch with each other and consume content. In the latter case, it is now used by thousands of simultaneous users to consume video, surpassing physical media as the primary means of distribution. With the rise of on-demand services and more recently, high-definition media, this popularity has not waned. To support this consumption, the underlying infrastructure has been forced to evolve at a rapid pace. This includes the technology and mechanisms to facilitate the transmission of video, which are now offered at varying levels of quality and resolution. Content delivery networks are often deployed in order to scale the distribution provision. These vary in nature and design; from third-party providers running entirely as a service to others, to in-house solutions owned by the content service providers themselves. However, recent innovations in networking and virtualisation, namely Software Defined Networking and Network Function Virtualisation, have paved the way for new content delivery infrastructure designs. In this thesis, we discuss the motivation behind OpenCache, a next-generation content delivery platform. We examine how we can leverage these emerging technologies to provide a more flexible and scalable solution to content delivery. This includes analysing the feasibility of novel redirection techniques, and how these compare to existing means. We also investigate the creation of a unified interface from which a platform can be precisely controlled, allowing new applications to be created that operate in harmony with the infrastructure provision. Developments in distributed virtualisation platforms also enables functionality to be spread throughout a network, influencing the design of OpenCache. Through a prototype implementation, we evaluate each of these facets in a number of different scenarios, made possible through deployment on large-scale testbeds