TY - JOUR
T1 - An efficient P2P content distribution system based on altruistic demand and recoding dissemination
AU - Li, Jung Shian
AU - Chao, Chih Hung
N1 - Funding Information:
Manuscript received July 2, 2009. Date of publication April 12, 2010; date of current version August 18, 2010. This work was supported in part by the National Science Council of Taiwan under Grants NSC 96-2219-E-006-009 and NSC 97-2221-E-006-092. This paper was recommended by Associate Editor A. Bargiela.
PY - 2010/9
Y1 - 2010/9
N2 - Peer-to-peer (P2P) content distribution systems based on random linear combination coding schemes outperform traditional block forwarding and source coding systems but have large storage requirements and high computation and communication overheads. To resolve this problem, this paper presents an efficient and scalable P2P content dissemination system based on novel altruistic demand and recoding dissemination mechanisms. In the proposed approach, the shared-content file is segmented and encoded using Reed-Solomon code at a seed. Downstream peers wishing to obtain the file utilize an altruistic demand mechanism to issue demand requests for coded blocks which are useful not only to themselves but also to their neighbors. Upon receiving these requests, the upstream peers utilize a recoding dissemination mechanism to provide the downstream peers with either an existing useful coded block or a new coded block produced using a Lagrange polynomial interpolation method. The two mechanisms rapidly increase the diversity of the coded blocks within the network and therefore provide an effective solution to the missing last block problem. In addition, it is shown that the proposed content distribution system demonstrates a substantial improvement over P2P systems based on random linear combination coding in terms of a lower storage requirement, reduced computation and communication costs, and an improved download efficiency.
AB - Peer-to-peer (P2P) content distribution systems based on random linear combination coding schemes outperform traditional block forwarding and source coding systems but have large storage requirements and high computation and communication overheads. To resolve this problem, this paper presents an efficient and scalable P2P content dissemination system based on novel altruistic demand and recoding dissemination mechanisms. In the proposed approach, the shared-content file is segmented and encoded using Reed-Solomon code at a seed. Downstream peers wishing to obtain the file utilize an altruistic demand mechanism to issue demand requests for coded blocks which are useful not only to themselves but also to their neighbors. Upon receiving these requests, the upstream peers utilize a recoding dissemination mechanism to provide the downstream peers with either an existing useful coded block or a new coded block produced using a Lagrange polynomial interpolation method. The two mechanisms rapidly increase the diversity of the coded blocks within the network and therefore provide an effective solution to the missing last block problem. In addition, it is shown that the proposed content distribution system demonstrates a substantial improvement over P2P systems based on random linear combination coding in terms of a lower storage requirement, reduced computation and communication costs, and an improved download efficiency.
UR - http://www.scopus.com/inward/record.url?scp=77955823070&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955823070&partnerID=8YFLogxK
U2 - 10.1109/TSMCA.2010.2044881
DO - 10.1109/TSMCA.2010.2044881
M3 - Article
AN - SCOPUS:77955823070
SN - 1083-4427
VL - 40
SP - 1083
EP - 1093
JO - IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans
JF - IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans
IS - 5
M1 - 5446371
ER -