A generic theoretical framework for modeling gossip-based algorithms

Authors:
Yaacov Fernandess;Antonio Fernández;Maxime Monod
Affiliations:
The Hebrew University of Jerusalem, Jerusalem, Israel;Universidad Rey Juan Carlos, Móstoles, Spain;Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Venue:
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Year:
2007

Citing 27
Cited 3

Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Using process groups to implement failure detection in asynchronous environments

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Randomized algorithms

Randomized algorithms
Gossiping on Meshes and Tori

IEEE Transactions on Parallel and Distributed Systems
Grapevine: an exercise in distributed computing

Communications of the ACM
Oblivious gossiping on tori

Journal of Algorithms
Peer-to-Peer Membership Management for Gossip-Based Protocols

IEEE Transactions on Computers
Probabilistic Reliable Dissemination in Large-Scale Systems

IEEE Transactions on Parallel and Distributed Systems
Randomized rumor spreading

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scalable and Secure Resource Location

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 4 - Volume 4
Lightweight probabilistic broadcast

ACM Transactions on Computer Systems (TOCS)
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
"-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Spatial gossip and resource location protocols

Journal of the ACM (JACM)
The peer sampling service: experimental evaluation of unstructured gossip-based implementations

Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Lower bounds on systolic gossip

Information and Computation
Faster gossiping on butterfly networks

Theoretical Computer Science - Automata, languages and programming
Correctness of a gossip based membership protocol

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Geographic gossip: efficient aggregation for sensor networks

Proceedings of the 5th international conference on Information processing in sensor networks
Gossip-based ad hoc routing

IEEE/ACM Transactions on Networking (TON)
Computing separable functions via gossip

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists Principles

P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Drinking from the firehose: multicast USENET news

WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Epidemic Information Dissemination in Distributed Systems

Computer
A gossip-style failure detection service

Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
T-Man: gossip-based overlay topology management

ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems

Epidemic protocols for pervasive computing systems: moving focus from architecture to protocol

M-PAC '09 Proceedings of the International Workshop on Middleware for Pervasive Mobile and Embedded Computing
Do neighbor-avoiding walkers walk as if in a small-world network?

INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
On the performance improvement of gossip protocols for content-based publish-subscribe through caching

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

During the past 30 years of the Internet revolution, the Internet has become a major force of change with an enormous effect on civilization. Consequently, computer networks have evolved into more complex system and become virtually ubiquitous. This in turn, has given raise to a growing demand for scalable and reliable computer system architectures. Thus far, there has been enormous effort by the research community to introduce decentralized, simple, and scalable distributed systems to solve a wide range of problems. In this paper we explore one promising solution, which was initially inspired by mathematical models that investigate two everyday life phenomena, epidemics and gossip, which we used interchangeably throughout the paper. During the last century, mathematicians developed models to predict the rate of diseases spread, namely epidemics, using differential equations. In addition, researches developed discrete mathematics models to predict what we already know; rumors spread fast, namely gossip. It was thus natural to harness these models in order to design distributed systems that mimic the basic behavior of such fast spreading everyday life paradigms.