IEICE TRANSACTIONS on Communications
Analysis of Optimal Scheduling in Tit-for-Tat-Based P2P File Distribution
Summary :
Peer-to-Peer (P2P) file distribution systems can efficiently disseminate massive contents, such as disk images of operating systems, from a server to many users in a piece-by-piece manner. In particular, the BitTorrent protocol optimizes each peer's download speed by applying the tit-for-tat (TFT) strategy, where each peer preferentially uploads piece(s) to peer(s) from which it can download missing pieces faster. To the best of our knowledge, however, the optimality of TFT-based P2P file distribution has not been studied sufficiently. In this paper, we aim to understand the optimal scheduling in TFT-based P2P file distribution. First, we develop a discrete-time model of TFT-based P2P file distribution and formulate its optimal scheduling as a two-step integer linear programming problem. The first step is to minimize the average file retrieval time among peers, and the second step is to improve fairness among peers. We analyze the optimal solution obtained by the existing solver and reveal the characteristics of the optimal scheduling. Specifically, we show that it is crucial to distribute pieces from the server indirectly to peers with large upload capacity via those with small upload capacity.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E97-B No.12 pp.2650-2657
- Publication Date
- 2014/12/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E97.B.2650
- Type of Manuscript
- Special Section PAPER (Special Section on Technologies and Architectures for Improving Scalability, Reliability, and Robustness for Future Information Networks)
- Category
Authors
Masashi HASEGAWA
Osaka University
Masahiro SASABE
Nara Institute of Science and Technology
Tetsuya TAKINE
Osaka University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Masashi HASEGAWA, Masahiro SASABE, Tetsuya TAKINE, "Analysis of Optimal Scheduling in Tit-for-Tat-Based P2P File Distribution" in IEICE TRANSACTIONS on Communications,
vol. E97-B, no. 12, pp. 2650-2657, December 2014, doi: 10.1587/transcom.E97.B.2650.
Abstract: Peer-to-Peer (P2P) file distribution systems can efficiently disseminate massive contents, such as disk images of operating systems, from a server to many users in a piece-by-piece manner. In particular, the BitTorrent protocol optimizes each peer's download speed by applying the tit-for-tat (TFT) strategy, where each peer preferentially uploads piece(s) to peer(s) from which it can download missing pieces faster. To the best of our knowledge, however, the optimality of TFT-based P2P file distribution has not been studied sufficiently. In this paper, we aim to understand the optimal scheduling in TFT-based P2P file distribution. First, we develop a discrete-time model of TFT-based P2P file distribution and formulate its optimal scheduling as a two-step integer linear programming problem. The first step is to minimize the average file retrieval time among peers, and the second step is to improve fairness among peers. We analyze the optimal solution obtained by the existing solver and reveal the characteristics of the optimal scheduling. Specifically, we show that it is crucial to distribute pieces from the server indirectly to peers with large upload capacity via those with small upload capacity.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.2650/_p
Copy
@ARTICLE{e97-b_12_2650,
author={Masashi HASEGAWA, Masahiro SASABE, Tetsuya TAKINE, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis of Optimal Scheduling in Tit-for-Tat-Based P2P File Distribution},
year={2014},
volume={E97-B},
number={12},
pages={2650-2657},
abstract={Peer-to-Peer (P2P) file distribution systems can efficiently disseminate massive contents, such as disk images of operating systems, from a server to many users in a piece-by-piece manner. In particular, the BitTorrent protocol optimizes each peer's download speed by applying the tit-for-tat (TFT) strategy, where each peer preferentially uploads piece(s) to peer(s) from which it can download missing pieces faster. To the best of our knowledge, however, the optimality of TFT-based P2P file distribution has not been studied sufficiently. In this paper, we aim to understand the optimal scheduling in TFT-based P2P file distribution. First, we develop a discrete-time model of TFT-based P2P file distribution and formulate its optimal scheduling as a two-step integer linear programming problem. The first step is to minimize the average file retrieval time among peers, and the second step is to improve fairness among peers. We analyze the optimal solution obtained by the existing solver and reveal the characteristics of the optimal scheduling. Specifically, we show that it is crucial to distribute pieces from the server indirectly to peers with large upload capacity via those with small upload capacity.},
keywords={},
doi={10.1587/transcom.E97.B.2650},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Analysis of Optimal Scheduling in Tit-for-Tat-Based P2P File Distribution
T2 - IEICE TRANSACTIONS on Communications
SP - 2650
EP - 2657
AU - Masashi HASEGAWA
AU - Masahiro SASABE
AU - Tetsuya TAKINE
PY - 2014
DO - 10.1587/transcom.E97.B.2650
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2014
AB - Peer-to-Peer (P2P) file distribution systems can efficiently disseminate massive contents, such as disk images of operating systems, from a server to many users in a piece-by-piece manner. In particular, the BitTorrent protocol optimizes each peer's download speed by applying the tit-for-tat (TFT) strategy, where each peer preferentially uploads piece(s) to peer(s) from which it can download missing pieces faster. To the best of our knowledge, however, the optimality of TFT-based P2P file distribution has not been studied sufficiently. In this paper, we aim to understand the optimal scheduling in TFT-based P2P file distribution. First, we develop a discrete-time model of TFT-based P2P file distribution and formulate its optimal scheduling as a two-step integer linear programming problem. The first step is to minimize the average file retrieval time among peers, and the second step is to improve fairness among peers. We analyze the optimal solution obtained by the existing solver and reveal the characteristics of the optimal scheduling. Specifically, we show that it is crucial to distribute pieces from the server indirectly to peers with large upload capacity via those with small upload capacity.
ER -
English
