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

Fingerprint

video on demand
Video on demand
Markov processes
Servers
video
resources

All Science Journal Classification (ASJC) codes

  • Cultural Studies
  • Communication

Cite this

@article{cc1b623eb23d4b88a1fc7fdbff41ffe9,
title = "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.",
author = "{Ashok Kumar}, R. and K. Hareesh and K. Ganesan and Manjaiah, {D. H.}",
year = "2009",
month = "1",
day = "1",
doi = "10.1504/IJAMC.2009.027013",
language = "English",
volume = "3",
pages = "277--289",
journal = "International Journal of Advanced Media and Communication",
issn = "1462-4613",
publisher = "Inderscience Enterprises Ltd",
number = "3",

}

M-chaining scheme for VoD application on cluster-based Markov process. / Ashok Kumar, R.; Hareesh, K.; Ganesan, K.; Manjaiah, D. H.

In: International Journal of Advanced Media and Communication, Vol. 3, No. 3, 01.01.2009, p. 277-289.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Ashok Kumar, R.

AU - Hareesh, K.

AU - Ganesan, K.

AU - Manjaiah, D. H.

PY - 2009/1/1

Y1 - 2009/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=68149123352&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68149123352&partnerID=8YFLogxK

U2 - 10.1504/IJAMC.2009.027013

DO - 10.1504/IJAMC.2009.027013

M3 - Article

AN - SCOPUS:68149123352

VL - 3

SP - 277

EP - 289

JO - International Journal of Advanced Media and Communication

JF - International Journal of Advanced Media and Communication

SN - 1462-4613

IS - 3

ER -