Journal ArticleDOI
M-chaining scheme for VoD application on cluster-based Markov process
TLDR
It is proved that a single stream is significant to serve different clients without duplicating the streams, and this is accomplished from new architecture for the VoD system, which makes use of Markov Process on the client machines.Abstract:
In a Video-on-Demand (VoD) system, by forwarding video segment client by client, a chain-based scheme is obtained, which reduces the server streams. The problem in the existing schemes is that the same video streams are duplicated and streamed to the different clients, which consumes more system resources. To solve this problem, we proved that a single stream is significant to serve different clients without duplicating the streams; this is accomplished from new architecture for the VoD system, which makes use of Markov Process on the client machines. By this way, more number of clients is chained for single server stream.read more
Citations
More filters
Journal ArticleDOI
Optimal fingerprint scheme for video on demand using block designs
TL;DR: A new Video on Demand architecture is proposed, which can strongly resist against collusion attacks from the traitors, and combines the proxy caching mechanisms in the peer to peer network to support larger users group.
Journal ArticleDOI
Video segmentation using Metropolis Hastings Algorithm for the VCR operations
R. Ashok Kumar,K. Ganesan +1 more
TL;DR: This paper has investigated the video pre-processing and the VCR operations for the Video on Demand (VoD) system and proposed a novel technique for the segmentation of the movies using Markov Chain Monte Carlo (MCMC), which shows the less computational time compared with other segmentation techniques.
Posted Content
A Reliable Replication Strategy for VoD System using Markov Chain
R. Ashok Kumar,K. Ganesan +1 more
TL;DR: This paper proposed a new data replication technique to optimally store the videos in the peers to maximize the availability of streams for the peers in the VoD system and achieved greater success playback probability of videos than the existing techniques.
References
More filters
Journal ArticleDOI
Probability and Statistics with Reliability, Queuing, and Computer Science Applications.
Robert Geist,Kishor S. Trivedi +1 more
TL;DR: Probability and Statistics with Reliability, Queuing and Computer Science Applications, Second Edition, offers a comprehensive introduction to probabiliby, stochastic processes, and statistics for students of computer science, electrical and computer engineering, and applied mathematics.
Book
Probability and Statistics With Reliability, Queuing and Computer Science Applications
TL;DR: Probability and Statistics with Reliability, Queuing and Computer Science Applications, Second Edition as discussed by the authors is a comprehensive introduction to probabiliby, stochastic processes, and statistics for students of computer science, electrical and computer engineering, and applied mathematics.
Proceedings ArticleDOI
Distributing streaming media content using cooperative networking
TL;DR: This work considers the problem that arises when the server is overwhelmed by the volume of requests from its clients, and proposes Cooperative Networking (CoopNet), where clients cooperate to distribute content, thereby alleviating the load on the server.
Proceedings ArticleDOI
Scheduling policies for an on-demand video server with batching
TL;DR: It is shown that an FCFS policy that schedules the movie with the longest outstanding request can perform better than the MQL policy that chooses the film with the maximum number of outstanding requests.
Proceedings ArticleDOI
Proxy prefix caching for multimedia streams
TL;DR: This work proposes a prefix caching technique whereby a proxy stores the initial frames of popular clips, and describes how to construct a smooth transmission schedule, based on the size of the prefix, smoothing, and playback buffers, without increasing client playback delay.