Epidemic information dissemination in distributed systems

PT Eugster, R Guerraoui, AM Kermarrec… - Computer, 2004 - ieeexplore.ieee.org
Easy to deploy, robust, and highly resilient to failures, epidemic algorithms are a potentially
effective mechanism for propagating information in large peer-to-peer systems deployed on …

Lightweight probabilistic broadcast

PT Eugster, R Guerraoui, SB Handurukande… - ACM Transactions on …, 2003 - dl.acm.org
Gossip-based broadcast algorithms, a family of probabilistic broadcast algorithms, trade
reliability guarantees against" scalability" properties. Scalability in this context has usually …

[图书][B] Introduction to reliable distributed programming

R Guerraoui, L Rodrigues - 2006 - books.google.com
In modern computing a program is usually distributed among several processes. The
fundamental challenge when developing reliable distributed programs is to support the …

Smart gossip: An adaptive gossip-based broadcasting service for sensor networks

P Kyasanur, RR Choudhury… - 2006 IEEE International …, 2006 - ieeexplore.ieee.org
A network-wide broadcast service is often used for information dissemination in sensor
networks. Sensor networks are typically energy-constrained and prone to failures. In view of …

Routing algorithms for content-based publish/subscribe systems

JL Martins, S Duarte - IEEE Communications Surveys & …, 2010 - ieeexplore.ieee.org
In content-based publish/subscribe systems, messages target a dynamic group of
participants whose expressed interests match the contents of the messages. In this …

Efficient reconciliation and flow control for anti-entropy protocols

R Van Renesse, D Dumitriu, V Gough… - proceedings of the 2nd …, 2008 - dl.acm.org
Efficient reconciliation and flow control for anti-entropy protocols Page 1 Efficient Reconciliation
and Flow Control for Anti-Entropy Protocols Robbert van Renesse ∗ Dan Dumitriu † Valient …

Regular transformations of infinite strings

R Alur, E Filiot, A Trivedi - … Annual IEEE Symposium on Logic in …, 2012 - ieeexplore.ieee.org
The theory of regular transformations of finite strings is quite mature with appealing
properties. This class can be equivalently defined using both logic (Monadic second-order …

Crew: A gossip-based flash-dissemination system

M Deshpande, B Xing, I Lazardis… - … Systems (ICDCS'06), 2006 - ieeexplore.ieee.org
In this paper, we explore a new form of dissemination called Flash Dissemination that
involves dissemination of fixed, rich information to a large number of recipients in as short a …

Neem: Network-friendly epidemic multicast

J Pereira, U do Minho, L Rodrigues… - 22nd International …, 2003 - ieeexplore.ieee.org
Epidemic, or probabilistic, multicast protocols have emerged as a variable mechanism to
circumvent the scalability problems of reliable multicast protocols. However, most existing …

How robust are gossip-based communication protocols?

L Alvisi, J Doumen, R Guerraoui, B Koldehofe… - ACM SIGOPS …, 2007 - dl.acm.org
Gossip-based communication protocols are often touted as being robust. Not surprisingly,
such a claim relies on assumptions under which gossip protocols are supposed to operate …