| Presentation | 2020-03-05 Linear Programming based Analysis for Minimum Distribution Time of Tit-for-Tat-based P2P File Distribution Yohei Nishi, Masahiro Sasabe, Shoji Kasahara, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In periodic file distribution, e.g., software update, distribution servers tend to be bottlenecks, due to the access concentration. To alleviate this problem, several systems, e.g., Windows update, have started applying Peer-to-Peer (P2P) file distribution where clients (peers) assist the distribution by uploading retrieved fragments of the file (pieces) to others. However, it has been pointed out that many peers tend to be free riders, which are not willing to upload pieces to others, so as to save their upload capacity. Tit-for-Tat (TFT) strategy in game theory is one of the practical mechanisms, which can build reciprocity per each pair of peers. In this paper, we formulate Linear Programming (LP) for minimizing file distribution time of the TFT-based P2P file distribution. Through numerical results, we reveal how the number of peers and upload capacity of peers and server affect the minimum file distribution time. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Peer-to-Peer (P2P) file distribution / Tit-for-Tat strategy / Minimum distribution time / Linear Programming (LP) |
| Paper # | NS2019-201 |
| Date of Issue | 2020-02-27 (NS) |
| Conference Information | |
| Committee | NS / IN |
|---|---|
| Conference Date | 2020/3/5(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Royal Hotel Okinawa Zanpa-Misaki |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | General |
| Chair | Yoshikatsu Okazaki(NTT) / Takuji Kishida(NTT-AT) |
| Vice Chair | Akihiro Nakao(Univ. of Tokyo) / Kenji Ishida(Hiroshima City Univ.) |
| Secretary | Akihiro Nakao(Osaka Pref Univ.) / Kenji Ishida(NTT) |
| Assistant | Shinya Kawano(NTT) |
| Paper Information | |
| Registration To | Technical Committee on Network Systems / Technical Committee on Information Networks |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Linear Programming based Analysis for Minimum Distribution Time of Tit-for-Tat-based P2P File Distribution |
| Sub Title (in English) | |
| Keyword(1) | Peer-to-Peer (P2P) file distribution |
| Keyword(2) | Tit-for-Tat strategy |
| Keyword(3) | Minimum distribution time |
| Keyword(4) | Linear Programming (LP) |
| 1st Author's Name | Yohei Nishi |
| 1st Author's Affiliation | Nara Institute of Science and Technology(NAIST) |
| 2nd Author's Name | Masahiro Sasabe |
| 2nd Author's Affiliation | Nara Institute of Science and Technology(NAIST) |
| 3rd Author's Name | Shoji Kasahara |
| 3rd Author's Affiliation | Nara Institute of Science and Technology(NAIST) |
| Date | 2020-03-05 |
| Paper # | NS2019-201 |
| Volume (vol) | vol.119 |
| Number (no) | NS-460 |
| Page | pp.pp.141-146(NS), |
| #Pages | 6 |
| Date of Issue | 2020-02-27 (NS) |