A Distribution Scheme for Continuous Media Contents over Peer-to-Peer Networks


KIPS Transactions on Computer and Communication Systems, Vol. 11, No. 7, pp. 511-520, Dec. 2004
10.3745/KIPSTA.2004.11.7.511,   PDF Download:

Abstract

A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content over peer-to-peer network. We focus on two problems in peer-to-peer media content distribution systems. The first is the transmission scheduling of the media data for a multi-source streaming session. We present a sophisticated scheduling scheme called fixed-length slotted scheduling, which results in minimum buffering delay. The second problem is on the fast distribution of media content in the peer-to-peer system that is self-growing. We propose a mechanism accelerating the speed at which the system's streaming capacity increases, called FAST.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 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
[IEEE Style]
J. B. Kwon, H. Y. Yeom and J. B. Lee, "A Distribution Scheme for Continuous Media Contents over Peer-to-Peer Networks," KIPS Journal A (2001 ~ 2012) , vol. 11, no. 7, pp. 511-520, 2004. DOI: 10.3745/KIPSTA.2004.11.7.511.

[ACM Style]
Jin Baek Kwon, Heon Young Yeom, and Jeong Bae Lee. 2004. A Distribution Scheme for Continuous Media Contents over Peer-to-Peer Networks. KIPS Journal A (2001 ~ 2012) , 11, 7, (2004), 511-520. DOI: 10.3745/KIPSTA.2004.11.7.511.