Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Exploiting the Synergy Between Gossiping and Structured Overlays
RISE, Swedish ICT, SICS, Computer Systems Laboratory.
RISE, Swedish ICT, SICS, Computer Systems Laboratory.ORCID iD: 0000-0002-6718-0144
2007 (English)In: ACM SIGOPS Operating Systems Review, Vol. 41, p. 61-66Article in journal (Refereed) Published
Abstract [en]

In this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale distributed systems. Despite the common goals, the two areas have, however, been relatively isolated. We focus on three problem domains where there is an untapped potential of using gossiping combined with SONs. We argue for applying gossip-based membership for ring-based SONs---such as Chord and Bamboo---to make them handle partition mergers and loopy networks. We argue that small world SONs---such as Accordion and Mercury---are specifically well-suited for gossip-based membership management. The benefits would be better graph-theoretic properties. Finally, we argue that gossip-based algorithms could use the overlay constructed by SONs. For example, many unreliable broadcast algorithms for SONs could be augmented with anti-entropy protocols. Similarly, gossip-based aggregation could be used in SONs for network size estimation and load-balancing purposes.

Place, publisher, year, edition, pages
2007, 1. Vol. 41, p. 61-66
Keywords [en]
distributed hash tables, gossip-based algorithms, structured overlay networks
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-22276DOI: 10.1145/1317379.1317389OAI: oai:DiVA.org:ri-22276DiVA, id: diva2:1041821
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2023-06-07Bibliographically approved

Open Access in DiVA

fulltext(127 kB)165 downloads
File information
File name FULLTEXT01.pdfFile size 127 kBChecksum SHA-512
98e2f476aae02a2ac216c1a1dc7530b2dea19c4b899a1b8265a6ef7f57dff03e465668f0fa7002ceb421420cfcb36b22c9769c0c4ee647d49931346059d3654c
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records

Haridi, Seif

Search in DiVA

By author/editor
Haridi, Seif
By organisation
Computer Systems Laboratory
Computer and Information Sciences

Search outside of DiVA

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

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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