ACM Home Page
Please provide us with feedback. Feedback
Lightweight probabilistic broadcast
Full text PdfPdf (546 KB)
Source ACM Transactions on Computer Systems (TOCS) archive
Volume 21 ,  Issue 4  (November 2003) table of contents
Pages: 341 - 374  
Year of Publication: 2003
ISSN:0734-2071
Authors
P. Th. Eugster  Distributed Programming Laboratory, EPFL, Lausanne, Switzerland
R. Guerraoui  Distributed Programming Laboratory, EPFL, Lausanne, Switzerland
S. B. Handurukande  Distributed Programming Laboratory, EPFL, Lausanne, Switzerland
P. Kouznetsov  Distributed Programming Laboratory, EPFL, Lausanne, Switzerland
A.-M. Kermarrec  Microsoft Research, Cambridge, UK
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 180,   Citation Count: 53
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/945506.945507
What is a DOI?

ABSTRACT

Gossip-based broadcast algorithms, a family of probabilistic broadcast algorithms, trade reliability guarantees against "scalability" properties. Scalability in this context has usually been expressed in terms of message throughput and delivery latency, but there has been little work on how to reduce the memory consumption for membership management and message buffering at large scale.This paper presents lightweight probabilistic broadcast (lpbcast), a novel gossip-based broadcast algorithm, which complements the inherent throughput scalability of traditional probabilistic broadcast algorithms with a scalable memory management technique. Our algorithm is completely decentralized and based only on local information: in particular, every process only knows a fixed subset of processes in the system and only buffers fixed "most suitable" subsets of messages. We analyze our broadcast algorithm stochastically and compare the analytical results both with simulations and concrete implementation measurements.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Bailey, N. 1975. The Mathematical Theory of Infectious Diseases and its Applications (second edition). Hafner Press.
3
4
 
5
Deering, S. 1994. Internet multicasting. In ARPA HPCC 94 Symposium. Advanced Research Projects Agency Computing Systems Technology Office.
6
 
7
Eugster, P. T., Felber, P., Guerraoui, R., and Kermarrec, A.-M. 2001a. The many faces of publish/subscribe. Tech. Rep. DSC/2001/004, Swiss Federal Institute of Technology, Lausanne, http://dscwww.epfl.ch/EN/publications/.
 
8
 
9
 
10
Eugster, P. T., Guerraoui, R., Kermarrec, A.-M., and Massoulie, L. 2003. From epidemics to distributed computing. IEEE Comput.
 
11
Golding, R. 1992. Weak consistency group communication for wide-area systems. In Proceedings of the Second Workshop on the Management of Replicated Data.
 
12
 
13
 
14
Kouznetsov, P., Guerraoui, R., Handurukande, S. B., and Kermarrec, A.-M. 2001. Reducing noise in gossip-based reliable broadcast. In Proceedings of the IEEE Symposium on Reliable Distributed Systems (SRDS 2001).
 
15
 
16
 
17
 
18
Paul, S., Sabnani, K., Lin, J., and Bhattacharyya, S. 1997. Reliable multicast transport protocol (RMTP). IEEE J. Selected Areas Comm. 15, 3 (Apr.), 407--421.
 
19
 
20
Rodrigues, L., Handurukande, S., Pereira, J., Guerraoui, R., and Kermarrec, A.-M. 2003. Adaptive gossip-based broadcast. In Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN 2003).
 
21
 
22
TIBCO. 1999. TIB/Rendezvous White Paper. http://www.rv.tibco.com/.
 
23
 
24
Xiao, Z. and Birman, K. 2001. Randomized error recovery algorithm for reliable multicast. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM).
 
25

CITED BY  53

Collaborative Colleagues:
P. Th. Eugster: colleagues
R. Guerraoui: colleagues
S. B. Handurukande: colleagues
P. Kouznetsov: colleagues
A.-M. Kermarrec: colleagues