liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Efficient and Highly Available Peer Discovery: A Case for Independent Trackers and Gossiping
Royal Institute of Technology, Stockholm, Sweden.
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
Royal Institute of Technology, Stockholm, Sweden.
2011 (English)In: 2011 IEEE International Conference on Peer-to-Peer Computing (P2P), IEEE , 2011, 290-299 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Series
Peer-to-Peer Computing (P2P), IEEE International Conference on, ISSN 2161-3559
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-80303DOI: 10.1109/P2P.2011.6038747ISBN: 978-1-4577-0150-4 (print)ISBN: 978-1-4577-0148-1 (print)OAI: oai:DiVA.org:liu-80303DiVA: diva2:546467
Conference
IEEE International Conference on Peer-to-Peer Computing (P2P), Kyoto, Japan, Aug/Sept. 2011
Available from: 2012-08-23 Created: 2012-08-23 Last updated: 2013-09-10

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Carlsson, Niklas

Search in DiVA

By author/editor
Carlsson, Niklas
By organisation
Database and information techniquesThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 59 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf