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 -