NDLI: Exploiting the synergy between gossiping and structured overlays

Content Provider	ACM Digital Library
Author	Ghodsi, Ali Weatherspoon, Hakim Haridi, Seif
Abstract	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.
Starting Page	61
Ending Page	66
Page Count	6
File Format	PDF
ISSN	01635980
DOI	10.1145/1317379.1317389
Journal	ACM SIGOPS Operating Systems Review (OPSR)
Volume Number	41
Issue Number	5
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1975-04-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Distributed hash tables Gossip-based algorithms Structured overlay networks
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Information Systems

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Exploiting the Synergy Between Gossiping and Structured Overlays

Exploiting the synergy between gossiping and structured overlays.

Maximizing throughput in wireless networks via gossiping

Gossiping over storage systems is practical

How robust are gossip-based communication protocols?

Gossiping in distributed systems

Low traffic overlay networks with large routing tables

Tree-assisted gossiping for overlay video distribution

Dealing with network partitions in structured overlay networks

Exploiting the synergy between gossiping and structured overlays

Similar Documents

Exploiting the Synergy Between Gossiping and Structured Overlays

Exploiting the synergy between gossiping and structured overlays.

Maximizing throughput in wireless networks via gossiping

Gossiping over storage systems is practical

How robust are gossip-based communication protocols?

Gossiping in distributed systems

Low traffic overlay networks with large routing tables

Tree-assisted gossiping for overlay video distribution

Dealing with network partitions in structured overlay networks

Exploiting the synergy between gossiping and structured overlays