Optimality analysis of locality-aware tit-for-tat-based P2P file distribution
- PDF / 1,842,578 Bytes
- 16 Pages / 595.224 x 790.955 pts Page_size
- 73 Downloads / 140 Views
Optimality analysis of locality-aware tit-for-tat-based P2P file distribution Yohei Nishi1 · Masahiro Sasabe1 · Shoji Kasahara1 Received: 30 December 2019 / Accepted: 4 May 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract In the current Internet, periodic software update is essential to maintain systems secure from malicious attacks. In case of proliferated software, e.g., Operating System (OS), the distribution server for update tends to be a bottleneck, due to the concentration of users’ requests. To tackle this problem, several systems, e.g., Windows Update, have been applying the Peer-to-Peer (P2P) file distribution technique where clients called peers upload retrieved fragments of the original file, i.e., pieces, to others. However, peers may not be willing to upload pieces to others, due to their own communication overhead. BitTorrent has adopted the Tit-for-Tat (TFT) strategy in game theory, which encourages peers to exchange an equivalent number of pieces among each pair of peers. In recent years, the optimality of TFT-based P2P content distribution, i.e., file distribution and streaming, has been analyzed with the help of Integer Linear Programming (ILP). In this paper, considering the fact that the communication overhead inside a group, e.g., LAN or Autonomous System (AS), is much less than that of between groups, we model locality-aware TFT-based P2P file distribution where the TFT constraint is relaxed for intragroup communications. We further formulate the optimal piece flow determination problem as ILP in the similar way to the existing work. Through numerical results, we show that the locality-aware TFT-based P2P file distribution can achieve quasi-optimal average file download time when the upload capacity of the server is a bottleneck and the number of groups is moderate. Keywords P2P file distribution · Tit-for-Tat strategy · Locality-awareness · Optimal piece flow · Integer Liner Programming (ILP)
1 Introduction Nowadays, periodic software update is essential to maintain the system secure against malicious attacks. When the This paper is an expanded version of the paper, which was presented at IEEE Consumer Communications & Networking Conference (CCNC 2020) [20] . This work was supported in part by JSPS KAKENHI (A) under Grant 19H01103 and JSPS KAKENHI (C) under Grant 19K11942, Japan. Yohei Nishi
[email protected] Masahiro Sasabe [email protected] Shoji Kasahara [email protected] 1
Graduate School of Science and Technology, Nara Institute of Science and Technology, 8916-5 Takayama-cho, Ikoma, Nara 630-0192, Japan
software is used by many users (e.g., Operating System (OS)) and/or new update files (e.g., security patch files) are released, users’ accesses concentrate on the distribution server, which causes flash crowd [6] and makes the server a bottleneck in terms of CPU and network resources. To tackle the scalability issue, several systems (e.g., Windows update) have been applying the Peer-to-Peer (P2P) technology to assist the distribution by e
Data Loading...
