Presentation | 2012-11-22 Network Coder Placement for Peer-to-Peer Content Distribution Dinh NGUYEN, Hidenori NAKAZATO, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | 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 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. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | peer-to-peer / content distribution / network coding |
Paper # | CS2012-74 |
Date of Issue |
Conference Information | |
Committee | CS |
---|---|
Conference Date | 2012/11/14(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Communication Systems (CS) |
---|---|
Language | ENG |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Network Coder Placement for Peer-to-Peer Content Distribution |
Sub Title (in English) | |
Keyword(1) | peer-to-peer |
Keyword(2) | content distribution |
Keyword(3) | network coding |
1st Author's Name | Dinh NGUYEN |
1st Author's Affiliation | Waseda University() |
2nd Author's Name | Hidenori NAKAZATO |
2nd Author's Affiliation | Waseda University |
Date | 2012-11-22 |
Paper # | CS2012-74 |
Volume (vol) | vol.112 |
Number (no) | 309 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |