• Journal of Internet Computing and Services
    ISSN 2287 - 1136 (Online) / ISSN 1598 - 0170 (Print)
    https://jics.or.kr/

P2Prefix : Efficient Broadcasting Streaming Scheme Based on P2P Caching


Chi-Hun Lee, Young Choi, Hwang-Kyu Choi, Journal of Internet Computing and Services, Vol. 8, No. 2, pp. 77-88, Apr. 2007
Full Text:
Keywords: Multimedia streaming, Cache, VOD, Broadcast, Pear to Pear

Abstract

A typical VOD service allows that a number of remote clients playback a desired video from a large collection of videos stored in one or more video servers. The main bottleneck for a VOD service is the network bandwidth connecting to the VOD server to the client due to the high bandwidth requirements. Many previous researches have shown that VOD server can be greatly improved through the use of multicast, broadcast, or P2P scheme. Broadcast is one of the most efficient techniques because it can transmit a stream to many users without additional network bandwidth. But the broadcast has long latency time. In order to overcome the drawback, in this paper, we propose P2Prefix broadcast scheme that can solve the service latency time, which is the problem of broadcast scheme, by using P2P caching as well as minimizing the client buffer requirement.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[APA Style]
Lee, C., Choi, Y., & Choi, H. (2007). P2Prefix : Efficient Broadcasting Streaming Scheme Based on P2P Caching. Journal of Internet Computing and Services, 8(2), 77-88.

[IEEE Style]
C. Lee, Y. Choi, H. Choi, "P2Prefix : Efficient Broadcasting Streaming Scheme Based on P2P Caching," Journal of Internet Computing and Services, vol. 8, no. 2, pp. 77-88, 2007.

[ACM Style]
Chi-Hun Lee, Young Choi, and Hwang-Kyu Choi. 2007. P2Prefix : Efficient Broadcasting Streaming Scheme Based on P2P Caching. Journal of Internet Computing and Services, 8, 2, (2007), 77-88.