Exploiting the synergy between gossiping and structured overlays
2007 (English)In: Operating Systems Review (ACM), ISSN 0163-5980, Vol. 41, no 5, 61-66 p.Article in journal (Refereed) Published
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
ACM, 2007. Vol. 41, no 5, 61-66 p.
Distributed hash tables, Gossip-based algorithms, Structured overlay networks
IdentifiersURN: urn:nbn:se:kth:diva-92100DOI: 10.1145/1317379.1317389ScopusID: 2-s2.0-64849092209OAI: oai:DiVA.org:kth-92100DiVA: diva2:512027
QC 20120327. Deltog på konferensen Gossip-Based Computer Networking i Leiden 1 december 20062012-03-262012-03-262012-03-27Bibliographically approved