Abstract
We compare the solvability of the Consensus and Broadcast problems in synchronous communication networks in which the delivery of messages is not reliable. The failure model is the mobile omission faults model. During each round, some messages can be lost and the set of possible simultaneous losses is the same for each round. We investigate these problems for the first time for arbitrary sets of possible failures. Previously, these sets were defined by bounding the numbers of failures. In this setting, we present a new necessary condition for the solvability of Consensus that unifies previous impossibility results in this area. This condition is expressed using Broadcastability properties. As a very important application, we show that when the sets of omissions that can occur are defined by bounding the numbers of failures, counted in any way (locally, globally, etc.), then the Consensus problem is actually equivalent to the Broadcast problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Charron-Bost, B., Schiper, A.: The heard-of model: computing in distributed systems with benign faults. Distributed Computing 22(1), 49–71 (2009)
Dobrev, S., Vrto, I.: Optimal broadcasting in hypercubes with dynamic faults. Information Processing Letters 71, 81–85 (1999)
Dobrev, S., Vrto, I.: Dynamic faults have small effect on broadcasting in hypercubes. Discrete Applied Mathematics 137(2), 155–158 (2004)
Fevat, T., Godard, E.: About minimal obstructions for the coordinated attack problem. In: IPDPS 2011 (2011)
Královič, R., Královič, R., Ruzička, P.: Broadcasting with many faulty links. Proceedings in Informatics 17, 211–222 (2003)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
Moses, Y., Rajsbaum, S.: A layered analysis of consensus. SIAM Journal on Computing 31(4), 989–1021 (2002)
Pease, L., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228–234 (1980)
Pin, J., Perrin, D.: Infinite Words. Elsevier, Amsterdam (2004)
Raynal, M.: Consensus in synchronous systems:a concise guided tour. IEEE Pacific Rim International Symposium on Dependable Computing 0, 221 (2002)
Santoro, N., Widmayer, P.: Time is not a healer. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol. 349, pp. 304–313. Springer, Heidelberg (1989)
Santoro, N., Widmayer, P.: Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384(2-3), 232–249 (2007)
Schmid, U., Weiss, B., Keidar, I.: Impossibility results and lower bounds for consensus under link failures. SIAM Journal on Computing 38(5), 1912–1951 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Godard, E., Peters, J. (2011). Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. In: Kosowski, A., Yamashita, M. (eds) Structural Information and Communication Complexity. SIROCCO 2011. Lecture Notes in Computer Science, vol 6796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-22212-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22211-5
Online ISBN: 978-3-642-22212-2
eBook Packages: Computer ScienceComputer Science (R0)