Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Gossip based peer sampling in social overlays
KTH, School of Electrical Engineering (EES), Communication Networks.
2014 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Performance of many P2P systems depends on the ability  to construct a ran-

dom overlay network among the nodes. Current state-of-the-art techniques for constructing random overlays have an implicit  requirement that any two nodes in the system should always be able to communicate and establish a link be- tween them.  However, this is not the case in some of the environments where distributed systems are required to be deployed,  e.g, Decentralized Online So- cial Networks, Wireless networks, or networks with limited connectivity because of NATs/firewalls,  etc. In such restricted networks, every node is able to com- municate with only a predefined set of nodes and thus, the existing solutions for constructing random overlays are not applicable.In this thesis we propose a gossip based peer sampling service capable of running on top of such restricted networks and producing an on-the-fly random overlay.  The service provides ev- ery participating node with a set of uniform random nodes from the network, as well as efficient routing paths for reaching those nodes via the restricted net- work. We perform extensive experiments on four real-world networks and show that  the resulting overlays rapidly converge to random overlays. The results also exhibit that the constructed random overlays have self healing behaviour under churn and catastrophic failures.

Place, publisher, year, edition, pages
2014.
Series
EES Examensarbete / Master Thesis
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-144278OAI: oai:DiVA.org:kth-144278DiVA: diva2:712542
Educational program
Master of Science - Software Engineering of Distributed Systems
Examiners
Available from: 2014-07-14 Created: 2014-04-15 Last updated: 2014-07-14Bibliographically approved

Open Access in DiVA

fulltext(453 kB)156 downloads
File information
File name FULLTEXT02.pdfFile size 453 kBChecksum SHA-512
2388fe1d0c7d437f4b1bda7c2cecf0a8301920cb2d5b540f19272e0a77cc6d8fab22636eaa34da3a897bdd15d2c51462ef663d92806eb073a9498457206b91cd
Type fulltextMimetype application/pdf

By organisation
Communication Networks
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 156 downloads
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

urn-nbn

Altmetric score

urn-nbn
Total: 155 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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