This document proposes a new retrieval strategy called CoRe for peer-to-peer video-on-demand systems. CoRe aims to minimize response time and maximize throughput. It does this by selecting multiple serving peers to collaboratively service each request based on factors like distance and available resources. The document outlines limitations of existing strategies, describes the CoRe algorithm in detail, and presents experimental results showing CoRe performs better than the Least Load First algorithm, especially under heavy workloads.
P2P Video-On-Demand Systems PresentationAshwini More
This document presents a new retrieval strategy called CollaborativeRetrieval (CoRe) for peer-to-peer video-on-demand systems. CoRe aims to minimize mean response time. It works by selecting multiple peers containing requested video replicas and calculating the cost to retrieve from each peer based on distance and total peers. This is compared to the Least Load First strategy, which selects a single peer and can be time consuming. Experimental results show CoRe performs significantly better and achieves up to a 36% improvement in response time over Least Load First, especially under heavy workloads. Future work could consider data corruption and peer/network failures.
Broadcasting protocols has the ability to improve the efficiency of VOD service by minimizing the bandwidth required to transfer video’s to client as requested. Harmonic broadcasting protocol is the most protocol among this those protocols. Here I present the characteristics and functionalities of Poly-harmonic Broadcast- ing Protocol. At the end of this paper , i also established a hypothesis to modify this Poly-harmonic Protocol so that client can receive the requested data at less waiting time along with less buffer storage.
QOS - LIQUIDSTREAM: SCALABLE MONITORING AND BANDWIDTH CONTROL IN PEER TO PEER...ijp2p
The vast majority of research in P2P live streaming systems focuses on system architectures that offer to
participating peers: high upload bandwidth utilization, low delays during the video stream diffusion,
robustness and stability under dynamic network conditions and peers behavior. On the other hand in order
to guarantee the complete and on time video distribution to every participating peer, the average upload
bandwidth of the participating peers should be always greater than the playback rate of the video stream.
Most of the approaches do not take into consideration this requirement. Thus, in this paper we propose a
very scalable monitoring mechanism of the total upload bandwidth of the participating peers, which is
dynamic, accurate and with low overhead. Moreover, by exploiting this monitoring mechanism we present
and evaluate an algorithm that allows the accurate and on time estimation of the minimal required
additional bandwidth that an external set of resources (e.g. auxiliary peers) have to contribute. In this way
we guarantee the uninterrupted the stream delivery and provide high Quality of Service (QoS) in live
streaming.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
The document discusses using software-defined networking (SDN) to improve quality of experience (QoE) for video streaming applications. It presents three research scenarios:
1) An SDN testbed that routes YouTube video traffic to minimize buffering times and maintain high video quality. Application-aware path selection achieved full bandwidth utilization while keeping buffer levels high.
2) A GENI testbed provides a scalable live video streaming service between university campuses. It demonstrated stable 1080p video transmission with minimal bandwidth usage.
3) An SDN solution for multi-party video conferencing that constructs multicast trees. It achieved higher average video rates and lower delays compared to traditional MCU-based approaches.
Channel bonding in DVB-S2X allows for increased throughput and transmission of higher bandwidth signals by utilizing multiple independent channels. It works by separating a high-speed data stream into multiple packets sent across independent channels, then recombines the packets at the receiver. This allows existing networks to support services like 8K UHDTV that require bandwidths beyond a single channel capacity. While it offers benefits like maximizing capacity and supporting higher quality services, it also has drawbacks like restricting available channels and increasing interference between channels.
This document discusses principles of peer-to-peer live video streaming and algorithms for reducing delay. It defines video streaming and the different types. It then defines concepts related to peer-to-peer live streaming like peer churn. The document introduces four algorithms for reducing delay in peer-to-peer live streaming: 1) On Reducing Mesh Delay, 2) A novel scheme to reduce among-peer delay, 3) A heuristic chunk scheduling algorithm, and 4) A Push-Pull with Buffer-Map Prediction Algorithm. The goal of these algorithms is to address problems like limited streaming rates and reduce delays.
The Effect of Seeking Operation on QoE of HTTP Adaptive Streaming ServicesIJCNCJournal
In this paper, we assess multidimensional QoE (Quality of Experience) of HTTP-based streaming services
in seeking operation to evaluate the effect of two transmission schemes: adaptive bitrate streaming and
progressive download. We perform a subjective experiment with two contents and various network load
conditions. In the experiment, subjects find pre-specified scenes by means of seeking the video as they want
to see the scenes right now. We also perform the principal component analysis for the assessment result of
multidimensional QoE. We then find that the adaptive bitrate streaming is not necessarily effective for QoE
enhancement; the effectiveness of the scheme depends on the usage of the system and network conditions.
P2P Video-On-Demand Systems PresentationAshwini More
This document presents a new retrieval strategy called CollaborativeRetrieval (CoRe) for peer-to-peer video-on-demand systems. CoRe aims to minimize mean response time. It works by selecting multiple peers containing requested video replicas and calculating the cost to retrieve from each peer based on distance and total peers. This is compared to the Least Load First strategy, which selects a single peer and can be time consuming. Experimental results show CoRe performs significantly better and achieves up to a 36% improvement in response time over Least Load First, especially under heavy workloads. Future work could consider data corruption and peer/network failures.
Broadcasting protocols has the ability to improve the efficiency of VOD service by minimizing the bandwidth required to transfer video’s to client as requested. Harmonic broadcasting protocol is the most protocol among this those protocols. Here I present the characteristics and functionalities of Poly-harmonic Broadcast- ing Protocol. At the end of this paper , i also established a hypothesis to modify this Poly-harmonic Protocol so that client can receive the requested data at less waiting time along with less buffer storage.
QOS - LIQUIDSTREAM: SCALABLE MONITORING AND BANDWIDTH CONTROL IN PEER TO PEER...ijp2p
The vast majority of research in P2P live streaming systems focuses on system architectures that offer to
participating peers: high upload bandwidth utilization, low delays during the video stream diffusion,
robustness and stability under dynamic network conditions and peers behavior. On the other hand in order
to guarantee the complete and on time video distribution to every participating peer, the average upload
bandwidth of the participating peers should be always greater than the playback rate of the video stream.
Most of the approaches do not take into consideration this requirement. Thus, in this paper we propose a
very scalable monitoring mechanism of the total upload bandwidth of the participating peers, which is
dynamic, accurate and with low overhead. Moreover, by exploiting this monitoring mechanism we present
and evaluate an algorithm that allows the accurate and on time estimation of the minimal required
additional bandwidth that an external set of resources (e.g. auxiliary peers) have to contribute. In this way
we guarantee the uninterrupted the stream delivery and provide high Quality of Service (QoS) in live
streaming.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
The document discusses using software-defined networking (SDN) to improve quality of experience (QoE) for video streaming applications. It presents three research scenarios:
1) An SDN testbed that routes YouTube video traffic to minimize buffering times and maintain high video quality. Application-aware path selection achieved full bandwidth utilization while keeping buffer levels high.
2) A GENI testbed provides a scalable live video streaming service between university campuses. It demonstrated stable 1080p video transmission with minimal bandwidth usage.
3) An SDN solution for multi-party video conferencing that constructs multicast trees. It achieved higher average video rates and lower delays compared to traditional MCU-based approaches.
Channel bonding in DVB-S2X allows for increased throughput and transmission of higher bandwidth signals by utilizing multiple independent channels. It works by separating a high-speed data stream into multiple packets sent across independent channels, then recombines the packets at the receiver. This allows existing networks to support services like 8K UHDTV that require bandwidths beyond a single channel capacity. While it offers benefits like maximizing capacity and supporting higher quality services, it also has drawbacks like restricting available channels and increasing interference between channels.
This document discusses principles of peer-to-peer live video streaming and algorithms for reducing delay. It defines video streaming and the different types. It then defines concepts related to peer-to-peer live streaming like peer churn. The document introduces four algorithms for reducing delay in peer-to-peer live streaming: 1) On Reducing Mesh Delay, 2) A novel scheme to reduce among-peer delay, 3) A heuristic chunk scheduling algorithm, and 4) A Push-Pull with Buffer-Map Prediction Algorithm. The goal of these algorithms is to address problems like limited streaming rates and reduce delays.
The Effect of Seeking Operation on QoE of HTTP Adaptive Streaming ServicesIJCNCJournal
In this paper, we assess multidimensional QoE (Quality of Experience) of HTTP-based streaming services
in seeking operation to evaluate the effect of two transmission schemes: adaptive bitrate streaming and
progressive download. We perform a subjective experiment with two contents and various network load
conditions. In the experiment, subjects find pre-specified scenes by means of seeking the video as they want
to see the scenes right now. We also perform the principal component analysis for the assessment result of
multidimensional QoE. We then find that the adaptive bitrate streaming is not necessarily effective for QoE
enhancement; the effectiveness of the scheme depends on the usage of the system and network conditions.
MiPSO: Multi-Period Per-Scene Optimization For HTTP Adaptive StreamingAlpen-Adria-Universität
Video delivery over the Internet has become more and more established in recent years due to the widespread use of Dynamic Adaptive Streaming over HTTP (DASH). The current DASH specification defines a hierarchical data model for Media Presentation Descriptions (MPDs) in terms of periods, adaptation sets, representations, and segments. Although multi-period MPDs are widely used in live streaming scenarios, they are not fully utilized in Video-on-Demand (VoD) HTTP adaptive streaming (HAS) scenarios. In this paper, we introduce MiPSO, a framework for Multi-Period per-Scene optimization, to examine multiple periods in VoD HAS scenarios. MiPSO provides different encoded representations of a video at either (i) maximum possible quality or (ii) minimum possible bitrate, beneficial to both service providers and subscribers. In each period, the proposed framework adjusts the video representations (resolution-bitrate pairs) by taking into account the complexities of the video content, with the aim of achieving streams at either higher qualities or lower bitrates. The experimental evaluation with a test video data set shows that MiPSO reduces the average bitrate of streams with the same visual quality by approximately 10% or increases the visual quality of streams by at least 1 dB in terms of Peak Signal-to-Noise (PSNR) at the same bitrate compared to conventional approaches.
Internet Path Selection on Video QoE Analysis and ImprovementsIJTET Journal
Abstract— Systematically study a large number of Internet paths between popular video destinations and clients to create an empirical understanding of the location, existence, and repetition of failures. Finding ways to lower a providers costs for real-time, Internet protocol television services through a Internet protocol television architecture and through intelligent destination-shifting of selected services investigate ways to recover from Quality of Experience degradation. Using Live Television and Video on Demand as examples, we can take advantage of the different deadlines associated with each service to effectively obtain these services. Designing and implementing a prototype packet forwarding module called source initiated frame restoration. We implemented source initiated frame restoration on nodes and compared the performance of source initiated frame restoration to the default Internet routing. We found that source initiated frame restoration outperforms IP path selection by providing higher on-screen perceptual quality. These failures are mapped to the desired video quality in need by reconstructing video clips and by conducting user surveys. We can then examine ways to recover from Quality of Experience degradation by choosing one hop detour paths that preserve application specific policies. Path ranking methodology is used to find the path which contain high quality videos with low cost and occupies very low memory space. By ranking videos according to their quality, size, and cost, the top ranking videos can be retrieved by the client.
This document discusses Dynamic Adaptive Streaming over HTTP (DASH) and research being done on it at ITEC. It introduces DASH and motivates the need for a standard. It describes a DASH dataset that was created to enable objective evaluation and the DASHEncoder used to generate content. Research on peer-assisted DASH and evaluating DASH under vehicular mobility is summarized. Finally, it provides an overview of DASH research and activities at ITEC, including publications, tools developed and statistics on usage of the ITEC DASH website.
Objective and Subjective QoE Evaluation for Adaptive Point Cloud StreamingAlpen-Adria-Universität
Volumetric media has the potential to provide the six degrees of freedom (6DoF) required by truly immersive media. However, achieving 6DoF requires ultra-high bandwidth transmissions, which real-world wide area networks cannot provide economically. Therefore, recent efforts have started to target the efficient delivery of volumetric media, using a combination of compression and adaptive streaming techniques. It remains, however, unclear how the effects of such techniques on the user-perceived quality can be accurately evaluated. In this paper, we present the results of an extensive objective and subjective quality of experience (QoE) evaluation of volumetric 6DoF streaming. We use PCC-DASH, a standards-compliant means for HTTP adaptive streaming of scenes comprising multiple dynamic point cloud objects. By means of a thorough analysis we investigate the perceived quality impact of the available bandwidth, rate adaptation algorithm, viewport prediction strategy, and user's motion within the scene. We determine which of these aspects has more impact on the user's QoE, and to what extent subjective and objective assessments are aligned.
A PROXY EFFECT ANALYIS AND FAIR ADATPATION ALGORITHM FOR MULTIPLE COMPETING D...Christopher Mueller
Multimedia streaming technologies based on the Hypertext Transfer Protocol (HTTP) are very popular and used by many content providers such as Netflix, Hulu, and Vudu. Recently, ISO/IEC MPEG has ratified Dynamic Adaptive Streaming over HTTP (DASH) which extends the traditional HTTP streaming with an adaptive component addressing the issue of varying bandwidth conditions that users are facing in networks based on the Internet Protocol (IP). Additionally, industry has already deployed several solutions based on such an approach which simplifies large scale deployment because the whole streaming logic is located at the client. However, these features may introduce drawbacks when multiple clients compete for a network bottleneck due to the fact that the clients are not aware of the network infrastructure such as proxies or other clients. This paper identifies these negative effects and the evaluation thereof using MPEG-DASH and Microsoft Smooth Streaming. Furthermore, we propose a novel adaptation algorithm introducing the concept of fairness regarding a cluster of clients. In anticipation of the results we can conclude that we achieve more efficient bottleneck bandwidth utilization and less quality switches.
ABR Algorithms Explained (from Streaming Media East 2016) Erica Beavers
Adaptive bitrate algorithms have become paramount in ensuring quality video delivery on every device and across varying network conditions. This presentation looks at the design goals and the inner workings of ABR logic, how it is used in the open-source players hls.js and dash.js, and what broadcasters can do to improve and optimize their own stack.
Optimized Selection of Streaming Servers with GeoDNS for CDN Delivered Live S...Zhenyun Zhuang
This document proposes a new DNS design called Sticky-DNS to optimize server selection for CDN-delivered live streaming. Sticky-DNS aims to minimize CDN transit costs while maintaining good viewer experience. Unlike traditional GeoDNS which selects the nearest origin server to an edge server, Sticky-DNS considers the full ingest-origin and origin-edge paths to potentially select a non-nearest origin server that results in lower overall transit costs. It does this by maintaining cost values for all server pairs and selecting origins to serve edges in a way that minimizes total path costs. For less popular streams, origins are chosen based on end-to-end path lengths, while for popular streams Sticky-DNS adapts to encourage reuse
The document discusses rate-adaptive video multicast in wireless networks. It proposes a new protocol called QDM that can provide differentiated video quality to heterogeneous clients based on their channel conditions. QDM constructs cluster-based structures to characterize client heterogeneity and adapts the transmission bitrate based on video quality feedback from cluster heads. Simulation results show QDM can efficiently adapt to network dynamics and variable video bitrates, achieving an average gain of 2-5 dB in video quality compared to leader-based approaches.
Pre-Con Education: Recognizing Your Network's Key Performance Indicators Th...CA Technologies
Understanding key network metrics that impact end-user experience and how to leverage these key performance indicators is imperative for troubleshooting issues and restoring optimal network performance.
In this presentation, you will learn how to establish fundamental metrics for technology communications, gain an understanding of key concepts attributed to communication processes, gain an understanding of network performance metrics that actually impact end users, understand five sources of network latency and learn to use reference models as a troubleshooting tool.
For more information on DevOps solutions from CA Technologies, please visit: http://bit.ly/1wbjjqX
The document discusses distributed multimedia systems. It describes characteristics of multimedia data including being time-based and bulky. It also covers quality of service (QoS) management which involves resource scheduling, admission control, and traffic shaping algorithms. Stream adaptation techniques like scaling and filtering allow applications to adapt to changing resource availability. The case study describes the Tiger video file server system which uses striping, mirroring and a distributed scheduling algorithm to deliver video on demand with high performance and scalability.
Vignesh V Menon is invited to talk on "Video Coding for HTTP Adaptive Streaming" on the Research@Lunch, which is a research webinar series by Humanitarian Technology (HuT) Labs, Amrita Vishwa Vidyapeetham University, India, exclusively for Ph.D. Scholars, UG, and PG Researchers in India. This talk will introduce the basics of video codecs and highlight the scope of HAS-related research on video encoding.
The document discusses an experiment comparing the performance of SPDY and RTSP for real-time video streaming. The experiment found that while SPDY had some advantages like fewer header packets and prioritized requests, its performance was not significantly better than RTSP. Limitations in resources meant the experiment could not be run simultaneously, potentially affecting results. In conclusion, the features of SPDY were not sufficient to prove it a clear replacement for HTTP in real-time video streaming.
(Slides) P2P video broadcast based on per-peer transcoding and its evaluatio...Naoki Shibata
Shibata, N., Yasumoto, K., and Mori, M.: P2P Video Broadcast based on Per-Peer Transcoding and its Evaluation on PlanetLab, Proc. of 19th IASTED Int'l. Conf. on Parallel and Distributed Computing and Systems (PDCS2007), (November 2007).
http://ito-lab.naist.jp/themes/pdffiles/071121.shibata.pdcs2007.pdf
A Channel Allocation Algorithm for Cognitive Radio Users Based on Channel Sta...Alpen-Adria-Universität
Cognitive radio networks by utilizing the spectrum holes in licensed frequency bands are able to efficiently manage the radio spectrum. A significant improvement in spectrum use can be achieved by giving secondary users access to these spectrum holes. Predicting spectrum holes can save significant energy that is consumed to detect spectrum holes. This is because the secondary users can only select the channels that are predicted to be idle channels. However, collisions can occur either between a primary user and secondary users or among the secondary users themselves. This paper introduces a centralized channel allocation algorithm in a scenario with multiple secondary users to control both primary and secondary collisions. The proposed allocation algorithm, which uses a channel status predictor, provides a good performance with fairness among the secondary users while they have the minimal interference with the primary user. The simulation results show that the probability of a wrong prediction of an idle channel state in a multi-channel system is less than 0.9%. In addition, the channel state prediction saves the sensing energy up to 73%, and the utilization of the spectrum can be improved more than 77%.
H2BR: An HTTP/2-based Retransmission Technique to Improve the QoE of Adaptive...Alpen-Adria-Universität
HTTP-based Adaptive Streaming (HAS) plays a key role in over-the-top video streaming. It contributes towards reducing the rebuffering duration of video playout by adapting the video quality to the current network conditions. However, it incurs variations of video quality in a streaming session because of the throughput fluctuation, which impacts the user's Quality of Experience (QoE). Besides, many adaptive bitrate (ABR) algorithms choose the lowest-quality segments at the beginning of the streaming session to ramp up the playout buffer as soon as possible. Although this strategy decreases the startup time, the users can be annoyed as they have to watch a low-quality video initially. In this paper, we propose an efficient retransmission technique, namely H2BR, to replace low-quality segments being stored in the playout buffer with higher-quality versions by using features of HTTP/2 including (i) stream priority, (ii) server push, and (iii) stream termination. The experimental results show that H2BR helps users avoid watching low video quality during video playback and improves the user's QoE. H2BR can decrease by up to more than 70% the time when the users suffer the lowest-quality video as well as benefits the QoE by up to 13%.
With the recent surge in Internet multimedia traffic, the enhancement and improvement of media players, specifically DASH media players happened at an incredible rate. DASH Media players take advantage of adapting a media stream to the network fluctuations by continuously monitoring the network and making decisions in near real-time. The performance of algorithms that are in charge of making such decisions was often difficult to be evaluated and objectively assessed.
CAdViSE provides a Cloud-based Adaptive Video Streaming Evaluation framework for the automated testing of adaptive media players. In this talk, I will introduce the CAdViSE framework, its application, and propose the benefits and advantages that it can bring to every web-based media player development pipeline. To demonstrate the power of CAdViSE in evaluating Adaptive Bitrate (ABR) algorithms I will exhibit its capabilities when combined with objective Quality of Experience (QoE) models. For this talk, my team at Bitmovin/ATHENA has selected the ITU-T P.1203 (mode 1) model in order to execute experiments and calculate the Mean Opinion Score (MOS), and better understand the behavior of a set of well-known ABR algorithms in a real-life setting. The talk will display how we tested and deployed our framework using a modular architecture into a cloud infrastructure. This method yields a massive growth to the number of concurrent experiments and the number of media players that can be evaluated and compared at the same time, thus enabling maximum potential scalability. In my team’s most recent experiments, we used Amazon Web Services (AWS) for demonstration purposes. Another awesome feature of CAdViSE that will be discussed here is the ability to shape the test network with endless network profiles. To do so, we used a fluctuation network profile and a real LTE network trace based on the recorded internet usage of a bicycle commuter in Belgium.
CAdViSE produces comprehensive logs for each media streaming experimental session. These logs can then be applied against different goals, such as objective evaluation to stitch back media segments and conduct subjective evaluations afterwards. In addition, startup delays, stall events, and other media streaming defects can be imitated exactly as they happened during the experimental streaming sessions.
Dynamic Adaptive Streaming over HTTP (DASH) is a media streaming technique that adapts to network conditions. It works by breaking media content into segments that can be requested independently. This allows clients to switch between different representations of the media to adapt to changing network conditions. DASH aims to provide high quality streaming over HTTP by enabling clients to dynamically switch between representations and request missing segments. It specifies formats and behaviors to enable efficient and high-quality delivery of streaming services over HTTP networks.
Chaining Algorithm and Protocol for Peer-to-Peer Streaming Video on Demand Sy...ijwmn
As the various architectures and protocol have been implemented a true VoD system has great demand in the global users. The traditional VoD system does not provide the needs and demands of the global users. The major problem in the traditional VoD system is serving of video stream among clients is duplicated and streamed to the different clients, which consumes more server bandwidth and the client uplink bandwidth is not utilized and the performance of the system degrades. Our objective in this paper is to send one server stream sufficient to serve the many clients without duplicating the server stream. Hence we have proposed a protocol and algorithm that chains the proxy servers and subscribed clients utilize client’s uplink bandwidth such that the load on the server is reduced. We have also proved that less rejection ratio of the clients and better utilization of the buffer and bandwidth for the entire VoD system.
Live multimedia streaming and video on demand issues and challengeseSAT Journals
Live streaming and video on demand face challenges in providing quality service over the internet. The key issues are quality of service due to network instability and degraded performance when serving large numbers of users. While peer-to-peer architectures can help solve issues of limited server resources, they introduce challenges such as ensuring sufficient upload bandwidth from peers and maintaining stable connectivity. Additional issues include firewalls and internet service provider throttling impacting streaming quality, and challenges in peer discovery and storage overhead in peer-to-peer video on demand systems. Addressing these architectural and performance issues is important for providing the best experience of streaming and video on demand services.
Implementing a Caching Scheme for Media Streaming in a Proxy ServerAbdelrahman Hosny
In the past few years, websites have moved from being
static web pages into rich media applications that use audio,
images and videos heavily in their interaction with users. This
change has made a dramatic change in network traffics
nowadays. Organizations spend a lot of effort, time and money
to improve response time and design intermediary systems that
enhance overall user experience. Media traffic represents
about 69.9-88.8% of all traffic. Therefore, enhancing networks
to accommodate this large traffic is a major trend. Content
Distribution Networks (CDNs) are now largely deployed for a
faster delivery of media. Redundancy and caching are also
implemented to decrease response time.
In this project, we are implementing a caching scheme for
media streaming in a proxy server. Unlike CDNs, which
require huge infrastructure, our caching proxy server will be
as simple as a piece of software that is portable and can be
installed in small as well as large scales. It may be deployed in
a university network, company’s private network or on ISPs
servers. This caching scheme, specially tailored for media
streaming, will reduce traffic and enhance network efficiency
in general.
Index Terms – Proxy servers, Caching, Media streaming
This document proposes a distributed video-on-demand (DVoD) system using a grid-based architecture. The key components are a media splitter, scheduler, and streaming servers distributed across grid nodes. The media is split into parts and distributed to nodes for storage. When a client requests a video, the scheduler coordinates streaming the split parts from multiple nodes to the client. This distributed approach aims to address issues like load balancing, scalability, and fault tolerance in a cost-effective manner compared to centralized systems. Related work on distributed streaming, peer-to-peer architectures, and adaptive encoding is also discussed.
MiPSO: Multi-Period Per-Scene Optimization For HTTP Adaptive StreamingAlpen-Adria-Universität
Video delivery over the Internet has become more and more established in recent years due to the widespread use of Dynamic Adaptive Streaming over HTTP (DASH). The current DASH specification defines a hierarchical data model for Media Presentation Descriptions (MPDs) in terms of periods, adaptation sets, representations, and segments. Although multi-period MPDs are widely used in live streaming scenarios, they are not fully utilized in Video-on-Demand (VoD) HTTP adaptive streaming (HAS) scenarios. In this paper, we introduce MiPSO, a framework for Multi-Period per-Scene optimization, to examine multiple periods in VoD HAS scenarios. MiPSO provides different encoded representations of a video at either (i) maximum possible quality or (ii) minimum possible bitrate, beneficial to both service providers and subscribers. In each period, the proposed framework adjusts the video representations (resolution-bitrate pairs) by taking into account the complexities of the video content, with the aim of achieving streams at either higher qualities or lower bitrates. The experimental evaluation with a test video data set shows that MiPSO reduces the average bitrate of streams with the same visual quality by approximately 10% or increases the visual quality of streams by at least 1 dB in terms of Peak Signal-to-Noise (PSNR) at the same bitrate compared to conventional approaches.
Internet Path Selection on Video QoE Analysis and ImprovementsIJTET Journal
Abstract— Systematically study a large number of Internet paths between popular video destinations and clients to create an empirical understanding of the location, existence, and repetition of failures. Finding ways to lower a providers costs for real-time, Internet protocol television services through a Internet protocol television architecture and through intelligent destination-shifting of selected services investigate ways to recover from Quality of Experience degradation. Using Live Television and Video on Demand as examples, we can take advantage of the different deadlines associated with each service to effectively obtain these services. Designing and implementing a prototype packet forwarding module called source initiated frame restoration. We implemented source initiated frame restoration on nodes and compared the performance of source initiated frame restoration to the default Internet routing. We found that source initiated frame restoration outperforms IP path selection by providing higher on-screen perceptual quality. These failures are mapped to the desired video quality in need by reconstructing video clips and by conducting user surveys. We can then examine ways to recover from Quality of Experience degradation by choosing one hop detour paths that preserve application specific policies. Path ranking methodology is used to find the path which contain high quality videos with low cost and occupies very low memory space. By ranking videos according to their quality, size, and cost, the top ranking videos can be retrieved by the client.
This document discusses Dynamic Adaptive Streaming over HTTP (DASH) and research being done on it at ITEC. It introduces DASH and motivates the need for a standard. It describes a DASH dataset that was created to enable objective evaluation and the DASHEncoder used to generate content. Research on peer-assisted DASH and evaluating DASH under vehicular mobility is summarized. Finally, it provides an overview of DASH research and activities at ITEC, including publications, tools developed and statistics on usage of the ITEC DASH website.
Objective and Subjective QoE Evaluation for Adaptive Point Cloud StreamingAlpen-Adria-Universität
Volumetric media has the potential to provide the six degrees of freedom (6DoF) required by truly immersive media. However, achieving 6DoF requires ultra-high bandwidth transmissions, which real-world wide area networks cannot provide economically. Therefore, recent efforts have started to target the efficient delivery of volumetric media, using a combination of compression and adaptive streaming techniques. It remains, however, unclear how the effects of such techniques on the user-perceived quality can be accurately evaluated. In this paper, we present the results of an extensive objective and subjective quality of experience (QoE) evaluation of volumetric 6DoF streaming. We use PCC-DASH, a standards-compliant means for HTTP adaptive streaming of scenes comprising multiple dynamic point cloud objects. By means of a thorough analysis we investigate the perceived quality impact of the available bandwidth, rate adaptation algorithm, viewport prediction strategy, and user's motion within the scene. We determine which of these aspects has more impact on the user's QoE, and to what extent subjective and objective assessments are aligned.
A PROXY EFFECT ANALYIS AND FAIR ADATPATION ALGORITHM FOR MULTIPLE COMPETING D...Christopher Mueller
Multimedia streaming technologies based on the Hypertext Transfer Protocol (HTTP) are very popular and used by many content providers such as Netflix, Hulu, and Vudu. Recently, ISO/IEC MPEG has ratified Dynamic Adaptive Streaming over HTTP (DASH) which extends the traditional HTTP streaming with an adaptive component addressing the issue of varying bandwidth conditions that users are facing in networks based on the Internet Protocol (IP). Additionally, industry has already deployed several solutions based on such an approach which simplifies large scale deployment because the whole streaming logic is located at the client. However, these features may introduce drawbacks when multiple clients compete for a network bottleneck due to the fact that the clients are not aware of the network infrastructure such as proxies or other clients. This paper identifies these negative effects and the evaluation thereof using MPEG-DASH and Microsoft Smooth Streaming. Furthermore, we propose a novel adaptation algorithm introducing the concept of fairness regarding a cluster of clients. In anticipation of the results we can conclude that we achieve more efficient bottleneck bandwidth utilization and less quality switches.
ABR Algorithms Explained (from Streaming Media East 2016) Erica Beavers
Adaptive bitrate algorithms have become paramount in ensuring quality video delivery on every device and across varying network conditions. This presentation looks at the design goals and the inner workings of ABR logic, how it is used in the open-source players hls.js and dash.js, and what broadcasters can do to improve and optimize their own stack.
Optimized Selection of Streaming Servers with GeoDNS for CDN Delivered Live S...Zhenyun Zhuang
This document proposes a new DNS design called Sticky-DNS to optimize server selection for CDN-delivered live streaming. Sticky-DNS aims to minimize CDN transit costs while maintaining good viewer experience. Unlike traditional GeoDNS which selects the nearest origin server to an edge server, Sticky-DNS considers the full ingest-origin and origin-edge paths to potentially select a non-nearest origin server that results in lower overall transit costs. It does this by maintaining cost values for all server pairs and selecting origins to serve edges in a way that minimizes total path costs. For less popular streams, origins are chosen based on end-to-end path lengths, while for popular streams Sticky-DNS adapts to encourage reuse
The document discusses rate-adaptive video multicast in wireless networks. It proposes a new protocol called QDM that can provide differentiated video quality to heterogeneous clients based on their channel conditions. QDM constructs cluster-based structures to characterize client heterogeneity and adapts the transmission bitrate based on video quality feedback from cluster heads. Simulation results show QDM can efficiently adapt to network dynamics and variable video bitrates, achieving an average gain of 2-5 dB in video quality compared to leader-based approaches.
Pre-Con Education: Recognizing Your Network's Key Performance Indicators Th...CA Technologies
Understanding key network metrics that impact end-user experience and how to leverage these key performance indicators is imperative for troubleshooting issues and restoring optimal network performance.
In this presentation, you will learn how to establish fundamental metrics for technology communications, gain an understanding of key concepts attributed to communication processes, gain an understanding of network performance metrics that actually impact end users, understand five sources of network latency and learn to use reference models as a troubleshooting tool.
For more information on DevOps solutions from CA Technologies, please visit: http://bit.ly/1wbjjqX
The document discusses distributed multimedia systems. It describes characteristics of multimedia data including being time-based and bulky. It also covers quality of service (QoS) management which involves resource scheduling, admission control, and traffic shaping algorithms. Stream adaptation techniques like scaling and filtering allow applications to adapt to changing resource availability. The case study describes the Tiger video file server system which uses striping, mirroring and a distributed scheduling algorithm to deliver video on demand with high performance and scalability.
Vignesh V Menon is invited to talk on "Video Coding for HTTP Adaptive Streaming" on the Research@Lunch, which is a research webinar series by Humanitarian Technology (HuT) Labs, Amrita Vishwa Vidyapeetham University, India, exclusively for Ph.D. Scholars, UG, and PG Researchers in India. This talk will introduce the basics of video codecs and highlight the scope of HAS-related research on video encoding.
The document discusses an experiment comparing the performance of SPDY and RTSP for real-time video streaming. The experiment found that while SPDY had some advantages like fewer header packets and prioritized requests, its performance was not significantly better than RTSP. Limitations in resources meant the experiment could not be run simultaneously, potentially affecting results. In conclusion, the features of SPDY were not sufficient to prove it a clear replacement for HTTP in real-time video streaming.
(Slides) P2P video broadcast based on per-peer transcoding and its evaluatio...Naoki Shibata
Shibata, N., Yasumoto, K., and Mori, M.: P2P Video Broadcast based on Per-Peer Transcoding and its Evaluation on PlanetLab, Proc. of 19th IASTED Int'l. Conf. on Parallel and Distributed Computing and Systems (PDCS2007), (November 2007).
http://ito-lab.naist.jp/themes/pdffiles/071121.shibata.pdcs2007.pdf
A Channel Allocation Algorithm for Cognitive Radio Users Based on Channel Sta...Alpen-Adria-Universität
Cognitive radio networks by utilizing the spectrum holes in licensed frequency bands are able to efficiently manage the radio spectrum. A significant improvement in spectrum use can be achieved by giving secondary users access to these spectrum holes. Predicting spectrum holes can save significant energy that is consumed to detect spectrum holes. This is because the secondary users can only select the channels that are predicted to be idle channels. However, collisions can occur either between a primary user and secondary users or among the secondary users themselves. This paper introduces a centralized channel allocation algorithm in a scenario with multiple secondary users to control both primary and secondary collisions. The proposed allocation algorithm, which uses a channel status predictor, provides a good performance with fairness among the secondary users while they have the minimal interference with the primary user. The simulation results show that the probability of a wrong prediction of an idle channel state in a multi-channel system is less than 0.9%. In addition, the channel state prediction saves the sensing energy up to 73%, and the utilization of the spectrum can be improved more than 77%.
H2BR: An HTTP/2-based Retransmission Technique to Improve the QoE of Adaptive...Alpen-Adria-Universität
HTTP-based Adaptive Streaming (HAS) plays a key role in over-the-top video streaming. It contributes towards reducing the rebuffering duration of video playout by adapting the video quality to the current network conditions. However, it incurs variations of video quality in a streaming session because of the throughput fluctuation, which impacts the user's Quality of Experience (QoE). Besides, many adaptive bitrate (ABR) algorithms choose the lowest-quality segments at the beginning of the streaming session to ramp up the playout buffer as soon as possible. Although this strategy decreases the startup time, the users can be annoyed as they have to watch a low-quality video initially. In this paper, we propose an efficient retransmission technique, namely H2BR, to replace low-quality segments being stored in the playout buffer with higher-quality versions by using features of HTTP/2 including (i) stream priority, (ii) server push, and (iii) stream termination. The experimental results show that H2BR helps users avoid watching low video quality during video playback and improves the user's QoE. H2BR can decrease by up to more than 70% the time when the users suffer the lowest-quality video as well as benefits the QoE by up to 13%.
With the recent surge in Internet multimedia traffic, the enhancement and improvement of media players, specifically DASH media players happened at an incredible rate. DASH Media players take advantage of adapting a media stream to the network fluctuations by continuously monitoring the network and making decisions in near real-time. The performance of algorithms that are in charge of making such decisions was often difficult to be evaluated and objectively assessed.
CAdViSE provides a Cloud-based Adaptive Video Streaming Evaluation framework for the automated testing of adaptive media players. In this talk, I will introduce the CAdViSE framework, its application, and propose the benefits and advantages that it can bring to every web-based media player development pipeline. To demonstrate the power of CAdViSE in evaluating Adaptive Bitrate (ABR) algorithms I will exhibit its capabilities when combined with objective Quality of Experience (QoE) models. For this talk, my team at Bitmovin/ATHENA has selected the ITU-T P.1203 (mode 1) model in order to execute experiments and calculate the Mean Opinion Score (MOS), and better understand the behavior of a set of well-known ABR algorithms in a real-life setting. The talk will display how we tested and deployed our framework using a modular architecture into a cloud infrastructure. This method yields a massive growth to the number of concurrent experiments and the number of media players that can be evaluated and compared at the same time, thus enabling maximum potential scalability. In my team’s most recent experiments, we used Amazon Web Services (AWS) for demonstration purposes. Another awesome feature of CAdViSE that will be discussed here is the ability to shape the test network with endless network profiles. To do so, we used a fluctuation network profile and a real LTE network trace based on the recorded internet usage of a bicycle commuter in Belgium.
CAdViSE produces comprehensive logs for each media streaming experimental session. These logs can then be applied against different goals, such as objective evaluation to stitch back media segments and conduct subjective evaluations afterwards. In addition, startup delays, stall events, and other media streaming defects can be imitated exactly as they happened during the experimental streaming sessions.
Dynamic Adaptive Streaming over HTTP (DASH) is a media streaming technique that adapts to network conditions. It works by breaking media content into segments that can be requested independently. This allows clients to switch between different representations of the media to adapt to changing network conditions. DASH aims to provide high quality streaming over HTTP by enabling clients to dynamically switch between representations and request missing segments. It specifies formats and behaviors to enable efficient and high-quality delivery of streaming services over HTTP networks.
Chaining Algorithm and Protocol for Peer-to-Peer Streaming Video on Demand Sy...ijwmn
As the various architectures and protocol have been implemented a true VoD system has great demand in the global users. The traditional VoD system does not provide the needs and demands of the global users. The major problem in the traditional VoD system is serving of video stream among clients is duplicated and streamed to the different clients, which consumes more server bandwidth and the client uplink bandwidth is not utilized and the performance of the system degrades. Our objective in this paper is to send one server stream sufficient to serve the many clients without duplicating the server stream. Hence we have proposed a protocol and algorithm that chains the proxy servers and subscribed clients utilize client’s uplink bandwidth such that the load on the server is reduced. We have also proved that less rejection ratio of the clients and better utilization of the buffer and bandwidth for the entire VoD system.
Live multimedia streaming and video on demand issues and challengeseSAT Journals
Live streaming and video on demand face challenges in providing quality service over the internet. The key issues are quality of service due to network instability and degraded performance when serving large numbers of users. While peer-to-peer architectures can help solve issues of limited server resources, they introduce challenges such as ensuring sufficient upload bandwidth from peers and maintaining stable connectivity. Additional issues include firewalls and internet service provider throttling impacting streaming quality, and challenges in peer discovery and storage overhead in peer-to-peer video on demand systems. Addressing these architectural and performance issues is important for providing the best experience of streaming and video on demand services.
Implementing a Caching Scheme for Media Streaming in a Proxy ServerAbdelrahman Hosny
In the past few years, websites have moved from being
static web pages into rich media applications that use audio,
images and videos heavily in their interaction with users. This
change has made a dramatic change in network traffics
nowadays. Organizations spend a lot of effort, time and money
to improve response time and design intermediary systems that
enhance overall user experience. Media traffic represents
about 69.9-88.8% of all traffic. Therefore, enhancing networks
to accommodate this large traffic is a major trend. Content
Distribution Networks (CDNs) are now largely deployed for a
faster delivery of media. Redundancy and caching are also
implemented to decrease response time.
In this project, we are implementing a caching scheme for
media streaming in a proxy server. Unlike CDNs, which
require huge infrastructure, our caching proxy server will be
as simple as a piece of software that is portable and can be
installed in small as well as large scales. It may be deployed in
a university network, company’s private network or on ISPs
servers. This caching scheme, specially tailored for media
streaming, will reduce traffic and enhance network efficiency
in general.
Index Terms – Proxy servers, Caching, Media streaming
This document proposes a distributed video-on-demand (DVoD) system using a grid-based architecture. The key components are a media splitter, scheduler, and streaming servers distributed across grid nodes. The media is split into parts and distributed to nodes for storage. When a client requests a video, the scheduler coordinates streaming the split parts from multiple nodes to the client. This distributed approach aims to address issues like load balancing, scalability, and fault tolerance in a cost-effective manner compared to centralized systems. Related work on distributed streaming, peer-to-peer architectures, and adaptive encoding is also discussed.
A COMPARISON OF CACHE REPLACEMENT ALGORITHMS FOR VIDEO SERVICESijcsit
The increasing demand for video services has made video caching a necessity to decrease download times
and reduce Internet traffic. In addition, it is very important to store the right content at the right time in
caches to make effective use of caching. An informative decision has to be made as to which videos are to
be evicted from the cache in case of cache saturation. Therefore, the best cache replacement algorithm is
the algorithm which dynamically selects a suitable subset of videos for caching, and maximizes the cache
hit ratio by attempting to cache the videos which are most likely to be referenced in the future. In this paper
we study the most popular cache replacement algorithms (OPT, CC, QC, LRU-2, LRU, LFU and FIFO)
which are currently used in video caching. We use simulations to evaluate and compare these algorithms
using video popularities that follow a Zipf distribution. We consider different cache sizes and video request
rates. Our results show that the CC algorithm achieves the largest hit ratio and performs well even under
small cache sizes. On the other hand, the FIFO algorithm has the smallest hit ratio among all algorithms.
The main problem is to avoid the complexity of retrieving the video content without streaming problem in multi network clients. The proposed work is to improve Collaboration among streaming contents on server resources in order to improve the network performance. Implementing network collaboration on a content delivery scenario, with a strong reduction of data transferred via servers. Audio and video files are transmitted in blocks to clients through the peer using the Network Coding Equivalent Content Distribution scheme. The objective of the system is to tolerate out-of-order arrival of blocks in the stream and is resilient to transmission losses of an arbitrary number of intermediate blocks, without affecting the verifiability of remaining blocks in the stream. To formulate the joint rate control and packet scheduling problem as an integer program where the objective is to minimize a cost function of the expected video distortion. Suggestions of cost functions are proposed in order to provide service differentiation and address fairness among users.
This document summarizes a study on simulating video streaming in multi-hop networks. It discusses using multiple access networks to stream video from a server to clients to aggregate bandwidth. The study formulates the problem of optimizing video streaming over internet packet traces as an integer program to minimize distortion. It proposes authenticating initial video streams using signatures and fragmenting/encoding content into blocks stored across peers to improve security and efficiency of content distribution in the presence of packet loss. Simulation results show this approach can reduce downloading time and avoid data loss during multi-hop video streaming.
Dynamic Chunks Distribution Scheme for Multiservice Load Balancing Using Fibo...Editor IJCATR
This document describes a proposed dynamic chunks distribution scheme for multiservice load balancing in cloud computing using a Fibonacci bases approach. Videos are split into chunks that are distributed across hosts for storage. The chunk sizes increase to reduce delay and improve performance. A Fibonacci-based splitting strategy is used to divide video files into chunks to reduce provisioning delay for users and optimize resource utilization. The scheme allows users to view entire videos without delays by gathering chunks from different servers in parallel.
A NOVEL ADAPTIVE CACHING MECHANISM FOR VIDEO ON DEMAND SYSTEM OVER WIRELESS M...IJCNCJournal
Video on Demand (VOD) system over the wireless mobile network is a system that provides video services to mobile clients. The main problem with these systems is the high service delay where the mobile clients have to wait to view their favorite movie. The importance of this paper is based on finding a solution on how to reduce the delay time in the VOD system. This paper introduces a novel caching mechanism named
Proxy Server Cache mechanism to tackle the issue of service delay. This delay happens when the broadcasting phase that is related to the first segment is missed by a client from the current broadcasting channels. In this mechanism, the video’s first segment is stored on a server of a stationary proxy type. The
delayed clients will directly acquire the first segment from the proxy server instead of waiting for the following broadcasting channel pertaining to the first segment. The proposed scheme ensuresobtaining the first segment from mobile clients when they arrive. Additionally, the performance of the proposed scheme is validated by applying the VOD system, which can involve the balancing mechanism to retain particular requests through to the local proxy server to provide a fair dissemination for these requests. The obtained result confirms that the proposed scheme reduces the time delay of the system in comparison with the best existing schemes. The results of the average time delay in the Proxy-Cache scheme is 179.2505
milliseconds when 10 clients arrive each minute (Client/minute), the average time delay is 140 milliseconds when the video lengths are 30, 60 and 90. Meanwhile, the failure probability for obtaining the first segment of the video remains zero when the number of arrived requests is set to2, 4, 6, 8 and 10.
This document presents a proposed peer-assisted video sharing system for online social networks. It begins with an introduction to increased popularity of video sharing and existing peer-assisted video on demand techniques. It then describes limitations of current client-server architectures, including high bandwidth costs. The proposed system aims to improve performance by exploring social relationships and interest similarities between peers. It uses four algorithms to construct peer overlays, prefetch chunks, deliver chunks and scheduling. The implementation aims to reduce data storage and bandwidth requirements while providing scalability. Simulation results show improved startup delays and reduced server traffic compared to existing systems.
Mobile-Based Video Caching Architecture Based on Billboard Manager csandit
Video streaming services are very popular today. Increasingly, users can now access multimedia applications and video playback wirelessly on their mobile devices. However, a significant challenge remains in ensuring smooth and uninterrupted transmission of almost any
size of video file over a 3G network, and as quickly as possible in order to optimize bandwidth consumption. In this paper, we propose to position our Billboard Manager to provide an optimal transmission rate to enable smooth video playback to a mobile device user connected to
a 3G network. Our work focuses on serving user requests by mobile operators from cached resource managed by Billboard Manager, and transmitting the video files from this pool. The
aim is to reduce the load placed on bandwidth resources of a mobile operator by routing away as much user requests away from the internet for having to search a video and, subsequently, if located, have it transferred back to the user.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
In this paper, we focuses on caching and replication algorithm for content distribution in peer to peer
networks. Caching and replication is a key strategy for improve the reliability, availability, and
performance in peer to peer networks. This paper gives a brief introduction to caching, replication and
various algorithms have been discussed and a detailed study has been performed. The comparison table
shows it clearly that an algorithm satisfies the caching and replication requirement.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
A Proposed Model for Web Proxy Caching Techniques to Improve Computer Network...Hossam Al-Ansary
This document proposes a model for using web proxy caching techniques to improve the performance of computer networks. It discusses how web proxy caching works by storing frequently requested web objects on proxy caches located within the network. This reduces network traffic, server load, and retrieval delays for users. The document also outlines some challenges with web proxy caching, such as cache size, consistency, and overhead. It then proposes using a combination of forward and reverse proxy caching to take advantage of the benefits of caching while overcoming its issues. This could help improve poor network communication in the Egyptian National Railways organization by enhancing efficiency and access for remote users.
Survey on caching and replication algorithm for content distribution in peer ...ijcseit
This document summarizes and compares several caching and replication algorithms for content distribution in peer-to-peer networks. It first introduces caching and replication techniques and their benefits, including reliability, availability, fault tolerance, load balancing and performance improvements. It then reviews six specific algorithms: 1) A weighted-rank cache replacement policy, 2) A streaming algorithm using multiple description coding, 3) Two prefetching protocols (full striping and code-based placement), 4) A popularity-aware limited caching approach, 5) Replication algorithms with random load balancing, and 6) An optimal replication strategy characterization. For each algorithm, it describes the approach and how it addresses challenges in peer-to-peer content distribution.
Efficient and thorough data collection and its timely analysis are critical for disaster response and recovery in order to save people's lives during disasters. However, access to comprehensive data in disaster areas and their quick analysis to transform the data to actionable knowledge are challenging. With the popularity and pervasiveness of mobile devices, crowdsourcing data collection and analysis has emerged as an effective and scalable solution. This paper addresses the problem of crowdsourcing mobile videos for disasters by identifying two unique challenges of 1) prioritizing visual data collection and transmission under bandwidth scarcity caused by damaged communication networks and 2) analyzing the acquired data in a timely manner. We introduce a new crowdsourcing framework for acquiring and analyzing the mobile videos utilizing fine granularity spatial metadata of videos for a rapidly changing disaster situation. We also develop an analytical model to quantify the visual awareness of a video based on its metadata and propose the visual awareness maximization problem for acquiring the most relevant data under bandwidth constraints. The collected videos are evenly distributed to off-site analysts to collectively minimize crowdsourcing efforts for analysis. Our simulation results demonstrate the effectiveness and feasibility of the proposed framework.
The document describes a system for optimizing media streaming in the cloud. It involves predicting future demand for streaming capacity and allocating cloud resources accordingly using an algorithm. The algorithm aims to minimize costs by reserving resources over time periods that provide discounts, while ensuring sufficient resources are available. It does this by varying the reservation time window size based on predicted demand and pricing tariffs. The system uses demand forecasting to continuously update predictions and improve resource allocation decisions over time. The goal is to improve quality of service for media streaming systems while reducing operational costs through efficient cloud resource utilization.
Server-based and Network-assisted Solutions for Adaptive Video StreamingEswar Publications
This document discusses server-based and network-assisted solutions for adaptive video streaming. It begins with an abstract that outlines server-based adaptive streaming is gaining popularity as clients and network devices are not powerful enough to run advanced adaptation algorithms. The document then provides a taxonomy that categorizes adaptive video streaming solutions and focuses on server-based and network-assisted solutions. It discusses various classical computing approaches relevant to server-based solutions such as traffic shaping, video pacing, and rate limiting. The document also proposes a taxonomy of server-based approaches and discusses state-of-the-art solutions for traffic management and protocol/parameter-centric categories. Finally, it discusses network-assisted solutions and recent approaches that show the advantages of using network-
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
1. A New Retrieval Strategy for P2P Video-on-Demand Systems
Ashwini R. More
CS Graduate student, SDSU
San Diego, CA 92182
ash.more@yahoo.co.in
Mounika Eluri
CS Graduate student, SDSU
San Diego, CA 92182
mounikaeluri28@gmail.com
Abstract
Delivering the media content over the network with
best response time has been a popular topic [2] [4] [5]
[8]. There are many efficient algorithms that have
addressed this issue such as the Least Load First
algorithm [4]. As its name states, Least Load First
algorithm selects a serving peer having the least load
for delivering the media content. Since only one peer is
responsible for servicing the request, it takes more
time to respond to the request, thereby affecting
response time. To address this limitation, we,
therefore, propose a novel and efficient strategy for
retrieving the videos. This scheme is called CoRe
abbreviated from our technical theme of
“collaborative retrieval”. Our objective is to achieve
minimum response time and maximize the overall
throughput of the system. In this strategy, we partition
the workload between peers over the network. There
are two main characteristics of CoRe: first, it selects
multiple peers for servicing the requests, and second, it
takes into account the distance factor from the
querying source while selection of these serving peers.
This helps to further maximize throughput and
minimize the mean response time. Moreover,
experimental results will show that CoRe performs
significantly better than existing Least Load First
algorithm even in the case of heavy workload.
1. Introduction
The VoD (Video on Demand) is a most popular
system [6] which allows users to select and
watch/listen to video content when they choose to,
rather than having to watch at a specific broadcast
time. There are many applications of the VoD service
namely digitally transmitted movies, local news and
weather forecasting, live streaming videos etc. VoD is
also used in educational institutions (viewing training
videos) and can enhance presentations in
videoconference environments.
In today’s busy world, every person desires
instantaneous response and so, fast response time is the
necessity. A good example is the online streaming
video-sharing website www.youtube.com. Videos on
such popular video-sharing website usually experience
a heavy demand and generate significantly large
amounts of traffic over the network. In this scenario,
response time is of paramount importance to the
impatient end users. When large numbers of consumers
demand multiple videos on a continuous basis, the total
amount of data involved (in terms of megabytes) can
overwhelm network resources. The performance of
VoD applications heavily depend on the underlying I/O
systems that enable the ability to serve user requests
almost instantaneously. An important consideration of
these VoD systems is to minimize the response time.
On the other hand, the system administrator’s main
goal is to maximize throughput – the total amount of
user requests that can be processed over a fixed period
of time. Response time and throughput are often
closely related since in most cases, the overall
throughput can be maximized by minimizing the
response time for individual requests.
Several architectures [2] [5] [8] [12] [13] have been
designed for VoD systems to gain efficiency. The
current Video on Demand systems are designed based
on the client server architecture. In this architecture,
the video server stores the videos and whenever the
client sends request for a video to the server, video
stream is downloaded on the client system and is
available for playback. As the number of client request
increases, the load on the server increases and due to
this there is rapid consumption of bandwidth.
Therefore, the design of the VoD system requires high
data rates to serve the large number of concurrent
clients. So, the design of such VoD systems faces
significant challenges.
Parallel [5] and distributed server architectures [8]
are used to balance the load on the server by
accommodating additional servers. Multiple servers are
involved in servicing the incoming requests thereby
partitioning the workload. The drawback of these
2. servers is the cost of upgrading the servers are high
since it requires high end hardware with large amount
of bandwidth and buffer.
Multiple approaches such as Content Delivery
Network (CDN), Proxy based system, Peer to Peer
system are used to decrease the cost factor required for
upgrading video servers. Content Delivery Network
(CDN) [13] approach makes use of web caching to
improve the client response times. In this approach it
reduces server load, (1)can deliver content faster and
improves availability. However, it is not cost-effective
due to high maintenance cost of servers and so
impractical for many organizations. In proxy based
system [12], the proxy server acts as an intermediary
between a web browser and the internet and improves
web performance as it uses web cache to store
frequently accessed web content. However, this
approach suffers from scalability problem. In P2P
(peer to peer) approach [2] [9], the load on the media
server is reduced as it partitions the workload between
peers. This approach is more reliable and the overall
cost of building and maintaining this kind of system is
comparatively very less. However, all the peers over
the network are not involved in streaming of the videos
which affects response time. In this paper, we address
this issue and propose an optimized algorithm, named
CoRe (Collaborative Retrieval) that tends to minimize
the response time. Another drawback of peer to peer
systems is that they have less bandwidth and also have
smaller storage capacity.
Researchers have developed several segment-based
proxy caching schemes [2] [3] to handle the large sizes
of media objects. In these, the media objects are cached
partially instead of entirely. Although the segment-
based caching strategy has shown its effectiveness for
media streaming, it fails to provide the quality of
service to clients due to following reasons. First, the
storage capacity of proxy is limited which will restrict
the amount of media content it can cache for users.
Second, a proxy becomes a system bottleneck, and also
forms a single point of failure. On the contrary, the
resources such as storage, bandwidth and CPU cycles
are richly available and under-utilized among the peers
in the P2P system.
A client side caching scheme called, earthworm [3]
was proposed to further minimize the load on the VoD
server. In this scheme, the client plays the video and
also forwards the video streams to another client with
sufficient buffer and delay, which is known as basic
chaining. This earthworm scheme is further extended
as forward, backward, optimal and adaptive chaining
[1] [3] [10] [11]. But, the client resources such as
uplink bandwidth and buffer are exploited. The
demand for high quality videos along with longer
duration of videos is increasing to a great extent.
Therefore, for such applications with high demand, the
existing chaining schemes fail to meet the scalability
requirements like buffer and bandwidth.
The chaining schemes mentioned above mainly
focus on the server load. To help improve the
reliability of media content in the peers, the redundant
movies are placed in the peers over the network.
Redundancy of movies can be implemented by several
different methods such as replication technique in
which multiple copies of movies are stored in the peers
across the network. The copies of the movies are
referred as replicas.
The proposed strategy of Mohamed and Bharat [7]
uses the special kind of control messages known as
heart beats for recovery from peer failures. Each peer
over the network sends the heart beat messages to its
parent and backup peers. This heart beat messages are
short messages which are sent over the reliable control
connection. Failure of a node is detected with the loss
of one or two heart beat messages. If the parent does
not receive two successive heart beats, the sender is
assumed to be failed. The drawback of this strategy is a
large overhead of control messages that are exchanged
over a longer period of time. In our approach we are
not using any kind of control messages; instead we are
selecting the optimal path for movie transmission with
lesser duration of time.
In our approach, we first build a scalable, reliable
and cost effective VoD system. To decrease the load
on the server, we combine peer to peer system and
proxy based system. Unlike client server architecture,
video streams are duplicated and placed in all the peers
over the network in such a way that none of the serving
peers store multiple copies of the same movie.
However, designing a reliable VoD system is a great
challenge; we investigated the streaming, i.e.
scheduling the video streams from the closest clients.
The CoRe strategy makes the selection of the serving
peers based on the cost factor measured with respect to
bandwidth and distance.
To prove the merit of CoRe over other algorithms,
we perform a comparison against Least Load First
algorithm, which will be discussed in detail later in the
Related Work section. In addition, results will show
that CoRe continues to perform well as the workload
increases.
To achieve these goals, performance will be
measured for Least Load First and CoRe strategies.
Next, results of the two algorithms will be compared to
show that CoRe strategy for responding to the request
provides performance improvements over Least Load
First.
The rest of this paper is organized as follows.
Section 2 gives a brief summary of the Least Load
First algorithm. Section 3 discusses the CoRe
3. algorithm in detail. Section 4 presents the experimental
results for both CoRe and Least Load First algorithm.
We have used a realistic simulation model for the
performance study. The performance metrics and the
experimental parameters that are used to generate the
workload are explained. Finally, Section 5 concludes
the paper.
2. Related Work
There are generally three major steps involved in
designing and building of any peer to peer VoD (Video
on Demand) system. Firstly, determine the copies of
videos i.e. replicas to be placed on different peers over
the network. Secondly, a data placement policy is
required to decide, how many number of replicas
should be stored in different peers. Thirdly, a selection
policy is required for selecting the peers that contains a
replica of the movie to serve the incoming requests.
The first step of determining the number of replicas
required for a particular movie is calculated using the
replication strategy proposed by Ashok Kumar and
Ganesan [4]. The second step of identifying the peers
for placement of the replicas follows the smallest load
first strategy. The peers having the least load are
identified first and the replicas are stored on them
accordingly. For the third step, several algorithms for
selection of the serving peers are proposed to attain
minimum response time. One example, Least Load
First algorithm, selects the least loaded peer for
servicing the request. Whenever a non-serving peer
makes a request for a movie with its existing resource
information to the proxy server, then proxy server
replies to this non-serving peer with the list of all
active serving peers which contains the requested
movie in it. Now the non-serving peer should make a
decision in selecting a serving peer from the list . In
Least Load First, the non-serving peer checks for the
least loaded serving peer to receive the requested
movie. The non-serving peer makes a request of
currently available resource information to all the
serving peers in the list. Then the requested non-
serving peer receives currently available resource
information from all the requested serving peers and it
sorts all the requested serving peers in non-increasing
fashion based on the available resource of the
requested serving peers. Finally, the non-serving peer
will select a serving peer with the highest resource
availability and least load for the reception of the
movie. The drawback of this strategy is that, since only
one peer is responsible for servicing the movie request,
the time it takes to respond the querying source is
more. Also, the serving peer may be far distant from
the querying source. Our proposed CoRe strategy
addresses these two problems with a goal of
minimizing system response time and maximizing
throughput.
3. The CoRe algorithm
The proposed model is a mixture of peer to peer
systems and proxy-based architecture, combining the
efficiency of both architectures.
The model consists of following components as shown
in Fig.1.
Multimedia server
Proxy servers and
Peer-to-peer systems
Fig 1. Architecture of P2P VoD System.
4. Fig 2. Popularity vs. no. of replicas.
Multimedia server holds movie files with a variety
of information such as index, popularity, size, duration,
minimum buffer, and maximum bandwidth of the
movies. The overall load of the system is uniformly
divided among the clusters. A cluster is composed of
group of peers which are connected to the proxy
server. The proxy server maintains a database of all the
available peers in the cluster. In the peer-to-peer
system, a peer is of two types- serving peer and a non-
serving peer.
We consider M to be the set of movies {m1, m2,..
mm} and the size of the mth
movie is denoted by Sm.
Each of these movie m is equally divided into V video
blocks such that m= ∑
Sm
i=1 Vi.
These video blocks are duplicated on all the peers of
the cluster, so when any of the peer requests for the
movie file, the peers holding the video block of the
requested movie will collectively contribute to serving
the request. Intuitive behind this idea is to improve the
mean response time. Here, the work load on the main
multimedia server is relaxed because of the load
distribution among the peers.
The request arrival rate for the mth movie is
exponentially distributed with a mean rate Λm and the
popularity of the mth movie; pm is derived from zipf’s
law. At the beginning, the proxy server maintains a list
of serving peers in its database. This list consists of
numerous parameters such as requested movie, CPU
speed, bandwidth, distance factor and storage capacity
of the serving peer. Whenever a peer sends a new
request to the main server, this request is redirected to
the proxy server where the peer belongs to that same
proxy server. In response, the proxy server replies back
with a dynamic list of available serving peers that have
maintained a copy of the requested movie to the
requesting peer. If the requested movie is available, the
querying peer selects the serving peers according to the
CoRe algorithm. If the requested movie is unavailable
in the proxy server or in any of the serving peers then
Input: Batch of movie requests, list of available
peers, list of movie replicas distributed across multiple
peers.
Output: response time for each request
1. for each request ri do
2. size = getSize(ri)
3. Get list of available peers containing the movie
and store in list Lp
4. Total = count (Lp)
5. for each peer pi in list Lp do
6. Set distance with respect to the request source
7. end for
8. Sort the list Lp according to the distance factor in
ascending order
9. for each peer pi in list Lp do
10. Calculate the cost, cost [pi]=distance[pi]/Total
subjected to that the sum of the costs of all
peers is approximately equal to 1. Also, the
peer with small distance value should have cost
value maximum and decreases linearly for
others as the distance increases.
11. Request_service_time = size *
cost [pi]/transfer_rate (31Kbps assumed)
12. end for
13. Record start time and end time for request ri
14. end for
Fig 3. Collaborative Retrieval (CoRe) Algorithm.
the initial portion of the video blocks are directly
streamed from the main server. The later portion of the
video blocks are first downloaded and buffered in the
proxy server itself which is then streamed directly from
the proxy server to the querying peer. With this
strategy, the load on the main multimedia server is
reduced due to the load sharing amongst the peers.
Also, the overall system resources are utilized quite
efficiently because it manages to use only the residual
bandwidth and buffer of the serving peers to serve non-
serving peers.
The objective of replication strategy is to ensure the
availability of the movies in the cluster, even in case of
serving peer failures. This is achieved by replicating
the copies of the movies in the serving peers. Various
replication strategies have been proposed to increase
the availability of videos. We have generated replicas
according to the replication strategy proposed in [4]. A
copy of the movie is always maintained in the proxy
server and replicas are also stored in different serving
peers while transmitting the movie in the cluster. This
helps in maximizing the availability of the movies in
the cluster. The peers with sufficient storage space are
5. identified and the copies of the movies are placed in
these serving peers accordingly. With this replication
strategy, the highest popular movies will have large
number of replicas and the replicas decreases as the
popularity decreases. Fig. 2 clearly illustrates this
characterization. After generating the number of
replicas to be placed, these replicas are further placed
in the serving peers according to the Smallest Load
First strategy [4].
Further, during servicing the request, the selection of
the serving peer is based on the least load of the peer
along with consideration of the closest ones. The
reason for the serving peer not being available can be
network failure, software or hardware failure,
insufficient network bandwidth or insufficient storage
space to store replicas. In our project, we have assumed
that peer is always available for responding to the
request.
Our main goal of minimizing the response time is
met by the Collaborative Retrieval (CoRe) Algorithm
(see Fig. 3). Based on the popularity and inter arrival
request rate of the movie, we have generated the
replicas of the movies. These duplicated copies are
stored in all the available serving peers in such a way
that the peer with smallest load is selected first to place
the replica. The popularity of the movie is derived
from zipf’s law. We have used the technique that
generates more number of replicas for the most popular
videos and the number of replicas decreases linearly
for the least popular videos [4]. Whenever a proxy
server receives request for a movie from the peer, it
replies back with the list of serving peers available for
servicing the request to the non-serving peer. While
responding to the incoming request, we first find out
the size of the requested movie. Then we find the total
number of peers available for serving the request, i.e.
the peers containing the requested movie. The distance
of the available peers from the request source is taken
into consideration while selecting the peers for
servicing the request. The selection of the nearer
clients is based on the cost factor measured with
respect to distance and the total number of peers that
are available for servicing the request (see step 9). The
percentage of a movie file to be downloaded from
these selected clients is decided on the cost factor (see
step 11). The transfer rate of a movie file is assumed to
be 31Kbps. The total time taken by the peers to serve
the request is calculated (see step 13). The details of
this calculation are described below.
In its most general form, a peer to peer system can
be represented by a group P of independent
homogeneous peers: P = {p1,…,pn}. The movies M =
{m1,…,mn} are to be placed on these peers. A peer pi
can be represented by pi = (ci, ti), where ci is the
capacity of the peer in GByte and ti is the available
time of the serving peer. The assumption is peer
storage capacities are quite large enough to store all of
the movies. A movie file mi consists of (ui, λi, si, li)
where ui is the popularity of the movie, λi is the mean
arrival rate of requests to a movie file, si is the size of
the movie file and li is the number of replicas to be
stored in different peers. For this research, λi is the
mean arrival rate of requests coming in for a movie file
mi. Accesses to a file exhibit a Poisson distribution
with a mean arrival rate λi. To calculate the percentage
of movie file to be downloaded from a particular peer,
first the distance factor is set from the querying source.
A distance array D is represented by D = (pi, di, ci)
where pi is the peer on which the replica of movie
request is present, di is the distance of the peer from the
requested source, ci is the cost in terms of percentage
of the movie file to be downloaded from peer pi. This
cost factor is calculated for each of the peer pi selected
for servicing the particular request. The sum of the cost
calculated for each of the serving peers should be equal
to 1, which represents the entire movie file. We assume
the distance between the source and destination node to
be constant.
A request set R consists of n total number of
requests and can be modeled as R = {r1,…,rq}.Each
request can be represented by rk = (midk, atk), where
midk, atk are the movie file identifier targeted by the
request, the arrival time of the request. When an
incoming request arrives, the CoRe algorithm finds
what peer the target file is placed upon. The request is
then directed to the peer’s local scheduling queue.
Two important parameters that are considered here
are the start time and the end time of a request rk. Start
time and end time are represented by sti(rk) and eti(rk),
respectively. The start time and end time must be
calculated in order to get the response time of a request
rk. Both the times are derived as below. When a request
rk arrives, two cases can be described as follows. The
first is when pi is idle, and the second is when pi is
busy.
sti(rk)={
atk,if pi
is idle
atk+ri,if pi
is busy
(1)
where atk is the arrival time of the request and ri is the
remaining service time of the request that is currently
running on peer pi.
It then follows that the eti (rk) can be represented by
eti (rk) = sti (rk)+ t midk (2)
where t midk is the service time of the movie file that is
targeted by request rk.
The response time of request rk can be calculated by
rti (rk) = eti (rk) - sti (rk) (3)
6. The mean response time for the request set R can be
calculated by
mrt( 𝑅)=
1
n
∑ rti(rk)
n
k=1,1≤i≤n
(4)
where n is the total number of requests.
4. Performance Evaluation
In this section, we evaluate the performance of both
Least Load First algorithm and CoRe using a synthetic,
yet realistic workload. Initially, we will present data
that compares the response times of CoRe with Least
Load First strategy over different aggregate access
rates. Also, we present the response improvement of
the proposed CoRe algorithm in terms of percentages.
Results will clearly show that CoRe performs
significantly better than Least Load First algorithm
especially under heavy workload conditions.
4.1. Simulation setup
In this section, we use simulation to evaluate the
performance of the proposed technique and compare
the results with the existing technique. We have used
Java to evaluate the performance of the system and
MATLAB software to plot the resulting graphs. We
evaluate the effectiveness of the proposed CoRe
(Collaborative Retrieval) algorithm by comparing it
with Least Load First algorithm. The algorithm is
described below.
Least Load First: When a peer sends a movie request,
the serving peer having the least load is chosen for
serving the request. Only one peer is involved in
processing the request.
Our proposed algorithm guarantees minimal
response time as it involves multiple peers in streaming
of videos. We have concentrated on the average
Fig 4. Average response time for 70/30 skew.
response time as the primary performance metric. The
performance metrics by which we evaluate system
performance include:
Mean response time: average response time for all
video access requests that are sent to the simulated
peer-to-peer system.
Mean response time improvement: decrease in
percentage of mean response time gained by CoRe
compared with Least Load First.
Before presenting empirical results, we present the
simulation model as follows. Table 1 summarizes the
configuration parameters of simulated peer-to-peer
system used in our experiments. Despite the fact that
the workload was synthetically generated, all
parameters were carefully controlled in order to model
the workload as accurately as possible. The sizes of the
files were distributed according to a zipfian distribution
with a skew parameter θ = (log X/100) / (log Y/100),
where X percent of all accesses were directed to Y
percent of files. We conducted experiments with the
skew parameter θ corresponding to either 70-30, 60-40
or 50-50 distributions. We tested the response times
with the number of requests varying from 2000 to
15000. The size of the movie is variable. We provided
input of 500 movies stored across 100 peers over the
network. The replicas of these movies are placed in the
peers according to smallest load first strategy.
Table 1. System parameters.
Parameter Value
Number of requests 2000-15000
Number of peers 100
Number of movies 500
Skew 50-50, 60-40, 70-30
Aggregate access 50, 100, 150, 200, 250, 300
(1/second) rate
Fig 5. Average response time for 60/40 skew.
7. Fig 6. Average response time for 50/50 skew.
Fig 8. Response Improvement (%) for 60/40 skew.
4.2. Impact of aggregate access rate
We observe from Fig. 4 that CoRe consistently
provides best response time compared to the Least
Load First algorithm for skew θ corresponding to
70/30 distribution. For example, for aggregate access
rate, λ = 200s-1
, CoRe provides a 20 percent
improvement over the response time of Least Load
First algorithm. The differences in response times of
the two algorithms increase as the aggregate access
rate increases. Similarly, Fig. 5 and Fig. 6 illustrates
the response times of both algorithms corresponding to
60/40 and 50/50 distribution respectively. It clearly
depicts that the CoRe strategy performs significantly
better than Least Load First in both graphs. Thus, the
experiments justify our claims about the importance of
involving multiple peers in the task of video retrieval.
Fig. 4, Fig. 5 & 6 also shows that, the higher the
aggregate access rate is, the more significant is the
improvement achieved by CoRe algorithm.
The differences in response times increase slowly
with smaller values of the skew parameter θ. However,
Fig 7. Response Improvement (%) for 70/30 skew.
Fig 9. Response Improvement (%) for 50/50 skew.
for θ corresponding to 60/40 distribution and aggregate
access rate λ = 200s-1
, CoRe still provides a 34 percent
improvement over Lead Load First algorithm.
Fig. 7 illustrates the response improvement
percentage of CoRe over the Least load First algorithm
for skew θ corresponding to a 70/30 distribution. The
results show that the greatest improvement of response
time occurs initially at λ = 50 (23%), decreases till λ =
150 (15%). The response time improvement increases
from λ = 150 as the aggregate access rate increases.
The highest response improvement of 36 percent
occurred at λ = 300. Similarly, Fig. 8 and Fig. 9
illustrates the response improvement percentage of
CoRe over the Least load First algorithm for skew θ
corresponding to a 60/40 and 50/50 distribution
respectively. Skew 60/40 shows highest response
improvement of 54 percent at λ = 50, while in skew
50/50, the highest response improvement is of 64
percent at λ = 100.
8. 5. Conclusions
Fast response time is an essential technology factor
in today’s world. Considerable research work has been
done to find more efficient ways of dealing with video
on demand systems in such a way that fast response
time can be achieved [2] [4] [5]. In this paper, we
studied the existing retrieval strategy, Least Load First,
which does not involve all the peers over the network
in streaming of videos, thereby affecting the response
time. In this project, we address this issue by involving
multiple peers based on their distances from the
querying source in serving the requests with an
objective of minimizing the response time.
Consideration of the optimal distance factor
contributed significantly in achieving efficiency. We
proposed a new retrieval strategy, CoRe (Collaborative
Retrieval) for peer-to-peer video-on-demand systems.
Our experimental results show that CoRe strategy
noticeably outperforms the Least Load First strategy.
The CoRe algorithm effectively reduced mean
response time. Intuitively, it follows that overall
system throughput would also be increased.
Further studies in this research can be performed by
taking into consideration the issues like, data
corruption, peer or network failure and recovery which
can contribute to performance improvement.
References
[1] CHEN J. K. AND WU J. L. C. 1999. “Adaptive chaining
scheme for distributed VOD applications”, IEEE Trans.
Broadcast., vol. 45, no. 2, pp. 215–224.
[2] GUO L., CHEN S., REN S., CHEN X., AND JIANG S.
2004. “PROP: a scalable and reliable P2P assisted proxy
streaming system”, In Proc. ICDCS’04, Tokyo,
Japan,pp.778-786.
[3] HUA K. A., SHEU S., AND WANG J. Z.
1997.“Earthworm: a network memory management
technique for large-scale distributed multimedia
applications”, In Proc. IEEE INFOCOM ’97, vol. 3, Kobe,
Japan, pp. 990–997.
[4] KUMAR ASHOK R. AND GANESAN K., “A Reliable
Replication Strategy for VoD System using Markov Chain”,
(IJCSIS) International Journal of Computer Science and
Information Security, Vol.6, No. 2, 2009.
[5] LEE J. Y. B. 1998, “Parallel Video Servers: A Tutorial”,
IEEE Multimedia, vol.5(2), pp.20–28.
[6] LIU J., LI B., AND ZHANG Y.-Q, “Adaptive video
multicast over the Internet”, IEEE Multimedia, vol. 10, pp.
22-33, Jan/Feb. 2003.
[7] MOHAMED M. HEFEEDA, BHARAT K.
BHARGAVA, AND DAVID K. Y. YAU, “A Hybrid
Architecture for Cost-Effective On-Demand Media
Streaming”, The International Journal of Computer and
Telecommunications Networking, Volume 44 , Issue 3,
Pages: 353 – 382, February 2004.
[8] ON G., ZINK M., LIEPERT M., GRIWODZ C.,
SCHMITT J.B., AND STEINMETZ R., 2001. “Replication
for a Distributed Multimedia System”, In Proceedings of the
Eighth International Conference on Parallel and Distributed
Systems, pp.37−42.
[9] PADMANABHAN V. N., WANG H. J., CHOU P. A.,
AND SRIPANIDKULCHAI K,2002. “Distributing
streaming media content using cooperative networking,
Technical Report”, MSR-TR-2002-37, Microsoet Research,
pp.1-13.
[10] SHEU S., HUA K. A., AND TAVANAPONG W, 1997.
“Chaining: a generalized batching technique for video-on-
demand systems”, In Proc. IEEE Int. Conf. Multimedia
Computing and Systems, Ottawa, ON, Canada, pp. 110–117.
[11] TE-CHOU SU, SHIH-YU HUANG, CHEN-LUNG
CHAN, AND JIA-SHUNG WANG ,2005. “Optimal
Chaining Scheme for Video-on-Demand Applications on
Collaborative Networks”, IEEE TRANSACTIONS ON
MULTIMEDIA, VOL. 7, NO. 5, pp-972-980.
[12] WANG Y., ZHANG Z., DU D., AND SU. D, 1998. “A
network-conscious approach to end-to-end video delivery
over wide area networks using proxy servers”, In Proc. of
IEEE INFOCOM’98, San Francisco, CA, USA.
[13] XUGUANG LAN, NANNING ZHENG, JIANRU XUE,
WEIKE CHEN, BIN WANG, AND WEN MA,2008.
“Manageable Peer-to-Peer Architecture for Video-on-
Demand”, IEEE International Symposium on Parallel and
Distributed Processing.