P-chaining: a practical VoD service scheme autonomically handling interactive operations

Kim, Hyun‐Joo; Yeom, Heon Y.

doi:10.1007/s11042-007-0160-5

Cited by 11 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It contains the outstanding thoughts from two efficient schemes: GEBB and patching scheme. P-chaining proposes a service scheme based on chaining [26], in which clients as well as the server provide streaming services. In the proposed scheme, services are provided by unicast and managed locally using node lists.…”

Section: Related Research Workmentioning

confidence: 99%

Distributed Client-Assisted Patching for Multicast Video-on-Demand Service in an Enterprise Network

Akbar¹,

Farhad²,

Jahan³

2017

JCP

View full text Add to dashboard Cite

Video-on-demand services allow users to select their desired video without watching the broadcast. Videos are stored in distributed servers. A single stream from the server can be utilized to satisfy a batch of common client requests. The key problem of this system is to minimize the server load to satisfy maximum number of clients. We propose a distributed client-side caching technique that reduces the server load significantly and increases the scalability of the system. We have implemented our system and compare our system with another state-of-the-art technique. Experimental results suggest that the newly proposed system outperforms the already proposed client assisted patching scheme.

show abstract

Section: Related Research Workmentioning

confidence: 99%

Distributed Client-Assisted Patching for Multicast Video-on-Demand Service in an Enterprise Network

Akbar¹,

Farhad²,

Jahan³

2017

JCP

View full text Add to dashboard Cite

show abstract

“…can strongly increase the burden on whole system. From the survey, we observed that certain P2P-VoD systems like VMesh [23], BulletMedia [24], Dynamic Skip List(DSL) [25], DP n 2P m [26], P2PVR [27], P-Chaining [28], DirectStream [29] and BitTorrentbased VoD system [30] provide fully interactive VoD services. Many researches [23][24][25][31][32][33][34][35] have discussed different approaches for building an interactive P2P-VoD system with the goal of minimizing the source searching cost.…”

Section: Interactive Services In Vodmentioning

confidence: 99%

P2P-VoD Streaming:

Ghosh

Rajan

Pandey

2014

Advanced Computing, Networking and Informatics- Volume 2

View full text Add to dashboard Cite

Abstract. Peer-to-Peer based Video-on-Demand (P2P-VoD) applications are becoming very popular for scalable video distribution in both academic and commercial environments. Asynchronous arrival of peers who wish to watch videos from beginning, as well as willing to avail interactive services like jump, rewind, fast-forward etc. in these systems makes it challenging to design and deploy them. A lot of research has already been done on the architectural design issues of P2P-VoD systems. In this paper, we present a survey on approaches which address some existing design issues like alleviating the server stress due to asynchrony, building efficient P2P-VoD applications with interactive services and handling peer churn as well as the time-varying nature of network. In addition to these issues, we also discuss the challenges in deployment of P2P-based VoD systems with additional user experience features like on-demand watching of segmented scenes, on-the-fly creation of playlists etc. over best-effort Internet.

show abstract

“…R Ashok Kumar et al [12] have proposed a streaming scheme, in which rejection rate is very high until number of chains increases for the video. Hyunjoo and Heon in [10] have proposed another chaining scheme with VCR operations. Here they do stream the video data from main server, but they consider constant threshold value, due to which more number of clients may not be able to share the same chain, hence increasing the rejection rate.…”

Section: Introductionmentioning

confidence: 99%