K. Ganesan

Bio: K. Ganesan is an academic researcher from VIT University. The author has contributed to research in topics: Image segmentation & Client–server model. The author has an hindex of 2, co-authored 2 publications receiving 5 citations.

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

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.

Video segmentation using Metropolis Hastings Algorithm for the VCR operations

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.

Optimal fingerprint scheme for video on demand using block designs

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.

A novel dynamic pricing scheme for contributing peers in the VoD system

Abstract: In this paper we have proposed a dynamic pricing scheme for the contributing peers in the Video on Demand (VoD) system. The scheme provides an effective mechanism to maximize the profit through the residual resources of the contributing peers. A utilization function is executed for each contributing peer to estimate the utility factor based on the parameters such as initial setup cost, holding cost, chaining cost and salvage cost. In this paper, we urge an effective dynamic pricing algorithm that efficiently utilizes a range of parameters with a varying degree of complexity. The key findings of the algorithm are (i) each contributing peers are benefitted by the monetary based on its resource contributions to the VoD system and (ii) a high degree of social optimum is established by proficiently aggregating the contributing peer's resources with the overall resources of the VoD system. We validate our claim by simulating the proposed dynamic pricing scheme with other standard pricing schemes such as altruism, cost model and game theory perspective. The result of our dynamic pricing scheme shows the best utility factor than other standard pricing schemes.

Video segmentation using Metropolis Hastings Algorithm for the VCR operations

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.

A Reliable Replication Strategy for VoD System using Markov Chain

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.