| Full text | |
| Author(s): |
Total Authors: 4
|
| Affiliation: | [1] Univ Fed Rio de Janeiro, Rio De Janeiro - Brazil
[2] Univ Massachusetts, Amherst, MA 01003 - USA
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | Computer Networks; v. 151, p. 93-113, MAR 14 2019. |
| Web of Science Citations: | 1 |
| Abstract | |
One of the fundamental problems in the realm of peer-to-peer systems is that of determining their service capacities. In this paper we focus on P2P scalability issues and propose models to compute the achievable throughput under distinct policies for selecting both peers and blocks. From these models, we obtain novel insights on the behavior of P2P swarming systems that motivate new mechanisms for publishers and peers to improve the overall performance. In particular, we obtain operational regions for swarm system. In addition, we show that system capacity significantly increases if publishers adopt the most deprived peer selection and peers reduce their service rates when they have all the file blocks but one. (C) 2019 Elsevier B.V. All rights reserved. (AU) | |
| FAPESP's process: | 15/24434-5 - Network measurement and modeling supporting resource allocation and user quality of experience |
| Grantee: | Edmundo Albuquerque de Souza e Silva |
| Support Opportunities: | Research Projects - Thematic Grants |