scispace - formally typeset
Journal ArticleDOI: 10.1504/IJAMC.2009.027013

M-chaining scheme for VoD application on cluster-based Markov process

01 Jul 2009-International Journal of Advanced Media and Communication (Inderscience Publishers)-Vol. 3, Iss: 3, pp 277-289
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. more

Topics: Client–server model (57%), Markov process (54%)

Journal ArticleDOI: 10.1007/S11042-011-0843-9
Abstract: Video fingerprint is a mechanism to protect movie from the traitors and also have the capability to identify the traitors. The problem arises in video fingerprint when several traitors having the same copies of a movie with different fingerprints collude together. During the collusion the original fingerprints in the movie will be removed or attenuated. Due to this the traitors can illegally copy, duplicate, record or redistribute the movie without having legitimate permissions. To avoid illegitimate acts of the traitors, a new Video on Demand architecture is proposed in this paper. This new architecture combines the proxy caching mechanisms in the peer to peer network to support larger users group. A new video fingerprinting scheme is proposed for this architecture, which can strongly resist against collusion attacks from the traitors. To check the appropriateness of our scheme, we have analyzed some of the existing schemes. The appropriateness is analyzed in terms of efficiency, effectivity and performance. To evaluate the optimality of these schemes, we have carried out simulation for our architecture. The results from the simulation show the optimal outcome for our scheme than any existing schemes. more

Topics: Fingerprint (computing) (54%)

4 Citations

Journal ArticleDOI: 10.1504/IJAMC.2010.034661
R. Ashok Kumar1, K. Ganesan1Institutions (1)
Abstract: In this paper, we have investigated the video pre-processing and the VCR operations for the Video on Demand (VoD) system. We have proposed a novel technique for the segmentation of the movies using Markov Chain Monte Carlo (MCMC). Our proposed segmentation technique will segment the videos by identifying the scene boundary locations. The objective of this paper is to reduce the accessing time for the new requests of the movies using M-chaining technique and also to reduce the seeking time for the VCR operations using our segmentation technique. We have numerically analysed the existing segmentation techniques with our proposed segmentation technique. We found that our segmentation technique shows the less computational time compared with other segmentation techniques. The performance of the segmentation techniques is measured in terms of Precision as well as Recall and our technique gives more accurate results compared with other segmentation techniques. The VCR functionalities are simulated by applying our segmentation technique and the results of the simulation show less accessing and seeking time. We have also addressed the practical issues of efficient utilisation of overall bandwidth and buffer of the VoD system using our segmentation technique. more

2 Citations

Open accessPosted Content
05 Dec 2009-arXiv: Multimedia
Abstract: In this paper we have investigated on the reliability of streams for a VoD system. The objective of the paper is to maximize the availability of streams for the peers in the VoD system. We have achieved this by using data replication technique in the peers. Hence, we proposed a new data replication technique to optimally store the videos in the peers. The new data replication technique generates more number of replicas than the existing techniques such as random, minimum request and maximize hit. We have also investigated by applying the CTMC model for the reliability of replications during the peer failures. Our result shows that the mean lifetime of replicas are more under various circumstances. We have addressed the practical issues of efficient utilization of overall bandwidth and buffer in the VoD system. We achieved greater success playback probability of videos than the existing techniques. Keywords-Reliability;Availability;Video on Demand; Peer; Proxy Server; Replication, Bandwidth, Buffer. more

1 Citations


Journal ArticleDOI: 10.2307/2322693
Abstract: 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. Its wealth of practical examples and up-to-date information makes it an excellent resource for practitioners as well. more

2,714 Citations

Open accessBook
Kishor S. Trivedi1Institutions (1)
01 Jan 1982-
Abstract: 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. Its wealth of practical examples and up-to-date information makes it an excellent resource for practitioners as well. more

Topics: Engineering statistics (62%), Computational statistics (60%), Applied probability (60%) more

2,629 Citations

Proceedings ArticleDOI: 10.1145/507670.507695
12 May 2002-
Abstract: In this paper, we discuss the problem of distributing streaming media content, both live and on-demand, to a large number of hosts in a scalable way Our work is set in the context of the traditional client-server framework Specifically, we consider the problem that arises when the server is overwhelmed by the volume of requests from its clients As a solution, we propose Cooperative Networking (CoopNet), where clients cooperate to distribute content, thereby alleviating the load on the server We discuss the proposed solution in some detail, pointing out the interesting research issues that arise, and present a preliminary evaluation using traces gathered at a busy news site during the flash crowd that occurred on September 11, 2001 more

910 Citations

Proceedings ArticleDOI: 10.1145/192593.192614
15 Oct 1994-
Abstract: In an on-demand video server environment, clients make requests for movies to a centralized video server. Due to the stringent response time requirements, continuous delivery of a video stream to the client has to be guaranteed by reserving sufficient resources required to deliver a stream. Hence there is a hard limit on the number of streams that can be simultaneously delivered by a server. The server can satisfy multiple requests for the same movie using a single disk I/O stream by sending the same data pages to multiple clients (using the multicast facility if present in the system). This can be achieved by batching requests for the same movie that arrive within a short duration of time. In this paper, we consider various policies for selecting the movie to be multicast. The choice of a policy depends very much on the customer waiting time tolerance before reneging. We show that an FCFS policy that schedules the movie with the longest outstanding request can perform better than the MQL policy that chooses the movie with the maximum number of outstanding requests. Additionally, if the user behavior can be influenced by guaranteeing maximum waiting time then it may be beneficial to pre-allocate a fixed number of streams for popular movies. Finally, we demonstrate using empirical distribution for movie requests, that a substantial reduction (of the order of 60%) in required server capacity can be achieved by batching. more

Topics: Video server (58%), Multicast (52%)

707 Citations

Proceedings ArticleDOI: 10.1109/INFCOM.1999.752149
21 Mar 1999-
Abstract: High latency and loss rates in the Internet make it difficult to stream audio and video without introducing a large playback delay. To address these problems, we propose a prefix caching technique whereby a proxy stores the initial frames of popular clips. Upon receiving a request for the stream, the proxy initiates transmission to the client and simultaneously requests the remaining frames from the server. In addition to hiding the delay, throughput, and loss effects of a weaker service model between the server and the proxy, this novel yet simple prefix caching technique aids the proxy in performing workahead smoothing into the client playback buffer. By transmitting large frames in advance of each burst, workahead smoothing substantially reduces the peak and variability of the network resource requirements along the path from the proxy to the client. We describe how to construct a smooth transmission schedule, based on the size of the prefix, smoothing, and playback buffers, without increasing client playback delay. Experiments with MPEG traces show how a few megabytes of buffer space at the proxy can substantially reduce the bandwidth requirements of variable-bit-rate video. Drawing on these results, we present guidelines for allocating buffer space for each stream, and how to effectively share buffer and bandwidth resources among multiple clients and streams. more

610 Citations

No. of citations received by the Paper in previous years