research-article

Meeting the deadline: on the complexity of fault-tolerant continuous gossip

Authors:

Chryssis Georgiou,

Dariusz R. KowalskiAuthors Info & Claims

PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Pages 247 - 256

https://doi.org/10.1145/1835698.1835759

Published: 25 July 2010 Publication History

Abstract

In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ensure good "Quality of Delivery," i.e., to deliver every rumor to every process before the deadline expires. Thus, a trivial solution to the problem of Continuous Gossip is simply for every process to broadcast every rumor as soon as it is injected. Unfortunately, this solution has a high per-round message complexity. Complicating matters, we focus our attention on a highly dynamic network in which processes may continually crash and recover. In order to achieve good per-round message complexity in a dynamic network, processes need to continually form and re-form coalitions that cooperate to spread their rumors throughout the network. The key challenge for a Continuous Gossip protocol is the ongoing adaptation to the ever-changing set of active rumors and non-crashed process. In this work we show how to address this challenge; we develop randomized and deterministic protocols for Continuous Gossip and prove lower bounds on the per-round message-complexity, indicating that our protocols are close to optimal.

References

[1]

K. P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM Trans. on Computer Systems, 17(2): 41--86, 1999.

Digital Library

[2]

B. Bollobas and W. Fernandez de la Vega. The diameter of random regular graphs. Combinatorica, 2(2): 125--134, 1982.

[3]

S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE Trans. on Information Theory, 52(6): 2508--2530, 2006.

Digital Library

[4]

M. R. Capalbo, O. Reingold, S. P. Vadhan, and A. Wigderson. Randomness conductors and constant-degree lossless expanders. In STOC 2002, pages 659--668.

Digital Library

[5]

B. S. Chlebus and D. R. Kowalski. Robust gossiping with an application to consensus. J. Comput. Syst. Sci., 72(8): 1262--1281, 2006.

Digital Library

[6]

B. S. Chlebus and D. R. Kowalski. Time and communication efficient consensus for crash failures. In DISC 2006, pages 314--328.

Digital Library

[7]

B. S. Chlebus, D. R. Kowalski, and A. A. Shvartsman. Collective asynchronous reading with polylogarithmic worst-case overhead. In STOC 2004, pages 321--330.

Digital Library

[8]

A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In PODC 1987, pages 1--12.

Digital Library

[9]

K. Diks and A. Pelc. Optimal adaptive broadcasting with a bounded fraction of faulty nodes. Algorithmica, 28(1): 37--50, 2000.

Digital Library

[10]

B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading: Expanders, push vs pull, and robustness. In ICALP 2009, pages 366--377.

Digital Library

[11]

P. Eugster, R. Guerraoui, S. Handurukande, A.-M. Kermarrec, and P. Kouznetsov. Lightweight probabilistic broadcast. ACM Trans. on Computer Systems, 21(4), 2003.

Digital Library

[12]

Z. Galil, A. Mayer, and M. Yung. Resolving message complexity of Byzantine agreement and beyond. In FOCS 1995, pages 724--733.

Digital Library

[13]

C. Georgiou, S. Gilbert, R. Guerraoui, and D. R. Kowalski. On the complexity of asynchronous gossip. In PODC 2008, pages 135--144.

Digital Library

[14]

Ch. Georgiou, D. R. Kowalski, and A. A. Shvartsman. Efficient gossip and robust distributed computation. Theor. Comput. Sci., 347(1--2): 130--166, 2005.

Digital Library

[15]

J. Hromkovic, R. Klasing, A. Pelc, P. Ruzika, and W. Unger. Dissemination of Information in Comm. Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance, Springer-Verlag, 2005.

Digital Library

[16]

R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized Rumor Spreading. In FOCS 2000, pages 565--574.

Digital Library

[17]

D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. J. of ACM, 51: 943--967, 2004.

Digital Library

[18]

A. Kermarrec, L. Massoulie, and A. Ganesh. Probabilistic reliable dissemination in large-scale systems. IEEE Trans. on Parallel and Distr. Syst., 14(3): 248--258, 2003.

Digital Library

[19]

D. R. Kowalski and M. Strojnowski. On the communication surplus incurred by faulty processors. In DISC 2007, pages 328--342.

Digital Library

[20]

A. Pelc. Fault-tolerant broadcasting and gossiping in communication networks. Networks, 28: 143--156, 1996.

[21]

M. S. Pinsker. On the complexity of a concentrator. In Proc. of 7th Annual Teletraffic Conference, 1973.

[22]

N. Pippenger. Sorting and selecting in rounds. SIAM J. Computing, 16: 1032--1038, 1987.

Digital Library

[23]

R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. In Proc. of IFIP Int-l Conference on Distributed Systems Platforms and Open Distributed Processing, pages 55--70, 1998.

Digital Library

[24]

A. Ta-Shma, C. Umans, and D. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In STOC 2001, pages 143--152.

Digital Library

Cited By

Georgiou CKowalski D(2015)On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restartsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2015.07.00784:C(94-107)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.jpdc.2015.07.007
Georgiou CKowalski D(2011)Performing dynamically injected tasks on processes prone to crashes and restartsProceedings of the 25th international conference on Distributed computing10.5555/2075029.2075049(165-180)Online publication date: 20-Sep-2011
https://dl.acm.org/doi/10.5555/2075029.2075049
Georgiou CGilbert SKowalski D(2011)Confidential GossipProceedings of the 2011 31st International Conference on Distributed Computing Systems10.1109/ICDCS.2011.71(603-612)Online publication date: 20-Jun-2011
https://dl.acm.org/doi/10.1109/ICDCS.2011.71
Show More Cited By

Index Terms

Meeting the deadline: on the complexity of fault-tolerant continuous gossip
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
  2. Dependable and fault-tolerant systems and networks
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Recommendations

Meeting the deadline: on the complexity of fault-tolerant continuous gossip

In this paper we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ensure good "Quality of Delivery," ...
Araneola: A scalable reliable multicast system for dynamic environments

This paper presents Araneola (Araneola means ''little spider'' in Latin.), a scalable reliable application-level multicast system for highly dynamic wide-area environments. Araneola supports multi-point to multi-point reliable communication in a fully ...
Confidential Gossip
ICDCS '11: Proceedings of the 2011 31st International Conference on Distributed Computing Systems

Epidemic gossip has proven a reliable and efficient technique for sharing information in a distributed network. Much of the reliability and efficiency derives from processes collaborating, sharing the work of distributing information. As a result of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

July 2010

494 pages

ISBN:9781605588889

DOI:10.1145/1835698

General Chairs:
Andrea Richa
Arizona State University, USA
,
Rachid Guerraoui
EPFL, Switzerland

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PODC '10

Sponsor:

PODC '10: ACM Symposium on Principles of Distributed Computing

July 25 - 28, 2010

Zurich, Switzerland

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
230
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Georgiou CKowalski D(2015)On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restartsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2015.07.00784:C(94-107)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.jpdc.2015.07.007
Georgiou CKowalski D(2011)Performing dynamically injected tasks on processes prone to crashes and restartsProceedings of the 25th international conference on Distributed computing10.5555/2075029.2075049(165-180)Online publication date: 20-Sep-2011
https://dl.acm.org/doi/10.5555/2075029.2075049
Georgiou CGilbert SKowalski D(2011)Confidential GossipProceedings of the 2011 31st International Conference on Distributed Computing Systems10.1109/ICDCS.2011.71(603-612)Online publication date: 20-Jun-2011
https://dl.acm.org/doi/10.1109/ICDCS.2011.71
Georgiou CKowalski D(2011)Performing Dynamically Injected Tasks on Processes Prone to Crashes and RestartsDistributed Computing10.1007/978-3-642-24100-0_15(165-180)Online publication date: 2011
https://doi.org/10.1007/978-3-642-24100-0_15
Holzer SPignolet YSmula JWattenhofer R(2010)Monitoring churn in wireless networksProceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities10.5555/1927083.1927094(118-133)Online publication date: 5-Jul-2010
https://dl.acm.org/doi/10.5555/1927083.1927094
Holzer SPignolet YSmula JWattenhofer R(2010)Monitoring Churn in Wireless NetworksAlgorithms for Sensor Systems10.1007/978-3-642-16988-5_11(118-133)Online publication date: 2010
https://doi.org/10.1007/978-3-642-16988-5_11

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten