On the Service Capacity of P2P Systems

Author

De Souza e Silva, Edmundo ; Leao, Rosa M. M. ; Sadoc Menasche, Daniel ; Towsley, Don

Author_Institution

Fed. Univ. of Rio de Janeiro (UFRJ), Rio de Janeiro, Brazil

fYear

2014

fDate

5-9 May 2014

Firstpage

26

Lastpage

33

Abstract

One of the most fundamental problems in the realm of peer-to-peer systems consists of determining their service capacity. In this paper, we first propose a new Markovian model to compute the throughput of peer-to-peer systems. Then, we present a simple approximate model for obtaining the system throughput for large peer populations. From the models, we obtain novel insights on the behavior of P2P swarming systems which motivate new mechanisms for publishers and peers to improve the overall performance. In particular, we show that if publishers adopt the most deprived peer selection, and peers reduce their service rate when they have all the file blocks but one, the system´s capacity can significantly increase.

Keywords

Markov processes; approximation theory; peer-to-peer computing; Markovian model; P2P swarming systems; approximate model; peer-to-peer systems; service capacity; system throughput; Computational modeling; Educational institutions; Markov processes; Peer-to-peer computing; Sociology; Throughput; P2P; analytical model; peer-to-peer systems; scalability;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Networks and Distributed Systems (SBRC), 2014 Brazilian Symposium on

Conference_Location

Florianopolis

Type

conf

DOI

10.1109/SBRC.2014.4

Filename

6927116