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

Authors: R. Ashok Kumar, K. Hareesh, K. Ganesan, D.H. Manjaiah

Addresses: School of Computing Sciences, VIT University, Vellore 632 014, Tamil Nadu, India. ' Department of Computer Science and Engineering, BMSIT, Bangalore 560064, Karnataka, India. ' School of Computing Sciences, VIT University, Vellore 632 014, Tamil Nadu, India. ' Department of Computer Sciences, Mangalore University, Mangalore 574 199, Karnataka, India

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.

Keywords: VoD; video-on-demand; chaining; segments; buffer; bandwidth; clustering; video streams.

DOI: 10.1504/IJAMC.2009.027013

International Journal of Advanced Media and Communication, 2009 Vol.3 No.3, pp.277 - 289

Published online: 13 Jul 2009 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article