No |
218508 |
標題(和) |
Network Coder Placement for Peer-to-Peer Content Distribution |
標題(英) |
Network Coder Placement for Peer-to-Peer Content Distribution |
研究会名(和) |
通信方式 |
研究会名(英) |
Communication Systems |
開催年月日 |
2012-11-21 |
終了年月日 |
2012-11-22 |
会議種別コード |
5 |
共催団体名(和) |
|
資料番号 |
CS2012-74 |
抄録(和) |
Network coding has been shown to accelerate peer-to-peer content distribution. Coding, i.e. combining data, at intermediate peers, can eliminate content duplication transmitted to downstream peers, which results in much shorter distribution time. The question is: do we need to code at every peer to achieve such good performance. In this paper, we figure the condition for network coding to be effective, and based on which, we propose an algorithm to selectively place coders inside a peer-to-peer content distribution in order to shorten distribution time, yet, using far fewer peers as encoders. Simulation results confirm the efficiency of our placement method. |
抄録(英) |
Network coding has been shown to accelerate peer-to-peer content distribution. Coding, i.e. combining data, at intermediate peers, can eliminate content duplication transmitted to downstream peers, which results in much shorter distribution time. The question is: do we need to code at every peer to achieve such good performance. In this paper, we figure the condition for network coding to be effective, and based on which, we propose an algorithm to selectively place coders inside a peer-to-peer content distribution in order to shorten distribution time, yet, using far fewer peers as encoders. Simulation results confirm the efficiency of our placement method. |
収録資料名(和) |
電子情報通信学会技術研究報告 |
収録資料の巻号 |
Vol.112, No.309 |
ページ開始 |
59 |
ページ終了 |
64 |
キーワード(和) |
|
キーワード(英) |
peer-to-peer,content distribution,network coding |
本文の言語 |
ENG |
著者(和) |
グエン ディン |
著者(ヨミ) |
|
著者(英) |
Dinh Nguyen |
所属機関(和) |
早稲田大学 |
所属機関(英) |
Waseda University |
著者(和) |
中里秀則 |
著者(ヨミ) |
|
著者(英) |
Hidenori Nakazato |
所属機関(和) |
早稲田大学 |
所属機関(英) |
Waseda University |