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

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

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)277-289
Number of pages13
JournalInternational Journal of Advanced Media and Communication
Volume3
Issue number3
DOIs
Publication statusPublished - 01-01-2009

All Science Journal Classification (ASJC) codes

  • Cultural Studies
  • Communication

Fingerprint Dive into the research topics of 'M-chaining scheme for VoD application on cluster-based Markov process'. Together they form a unique fingerprint.

  • Cite this