liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Efficient and Highly Available Peer Discovery: A Case for Independent Trackers and Gossiping
Royal Institute of Technology, Stockholm, Sweden.
Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
Royal Institute of Technology, Stockholm, Sweden.
2011 (Engelska)Ingår i: 2011 IEEE International Conference on Peer-to-Peer Computing (P2P), IEEE , 2011, s. 290-299Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
IEEE , 2011. s. 290-299
Serie
Peer-to-Peer Computing (P2P), IEEE International Conference on, ISSN 2161-3559
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:liu:diva-80303DOI: 10.1109/P2P.2011.6038747ISBN: 978-1-4577-0150-4 (tryckt)ISBN: 978-1-4577-0148-1 (tryckt)OAI: oai:DiVA.org:liu-80303DiVA, id: diva2:546467
Konferens
IEEE International Conference on Peer-to-Peer Computing (P2P), Kyoto, Japan, Aug/Sept. 2011
Tillgänglig från: 2012-08-23 Skapad: 2012-08-23 Senast uppdaterad: 2018-01-12

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Carlsson, Niklas

Sök vidare i DiVA

Av författaren/redaktören
Carlsson, Niklas
Av organisationen
Databas och informationsteknikTekniska högskolan
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 64 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf