Change search
ReferencesLink to record
Permanent link

Direct link
Efficient and Highly Available Peer Discovery: A Case for Independent Trackers and Gossiping
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-4876-0223
Linköping University.
KTH, School of Electrical Engineering (EES), Communication Networks.
2011 (English)In: IEEE Conference on Peer-to-peer Computing, IEEE , 2011, 290-299 p.Conference paper (Refereed)
Abstract [en]

Abstract—Tracker-based peer-discovery is used in most commercial peer-to-peer content distribution systems, as it provides performance benefits compared to distributed solutions, and facilitates the control and monitoring of the overlay. But a tracker is a central point of failure, and its deployment and maintenance incur costs; hence an important question is how high tracker availability can be achieved at low cost. We investigate highly available, low overhead peer discovery, using independent trackers and a simple gossip protocol. This work is a step towards understanding the trade-off between the overhead and the achievable peer connectivity in highly available distributed overlay-management systems for peer-to-peer content distribution. We propose two protocols that connect peers in different swarms efficiently with a constant, but tunable, overhead. The two protocols, Random Peer Migration (RPM) and Random Multi-Tracking (RMT), employ a small fraction of peers in a torrent to virtually increase the size of swarms. We develop analytical models of the protocols based on renewal theory, and validate the models using both extensive simulations and controlled experiments. We illustrate the potential value of the protocols using large-scale measurement data that contains hundreds of thousands of public torrents with several small swarms, with limited peer connectivity. We estimate the achievable gains to be up to 40% on average for small torrents.

Place, publisher, year, edition, pages
IEEE , 2011. 290-299 p.
, IEEE International Conference on Peer-to-Peer Computing, ISSN 2161-3567
National Category
Engineering and Technology
Research subject
URN: urn:nbn:se:kth:diva-47474DOI: 10.1109/P2P.2011.6038747ISI: 000298838500041ScopusID: 2-s2.0-80054967635OAI: diva2:455467
11th IEEE International Conference on Peer-to-Peer Computing (P2P)
QC 20111114Available from: 2011-11-10 Created: 2011-11-10 Last updated: 2012-04-03Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Dán, GyörgyChatzidrossos, Ilias
By organisation
Communication Networks
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 15 hits
ReferencesLink to record
Permanent link

Direct link