Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Afek Y, Gafni E (2013) Asynchrony from synchrony. In: Proceedings of the international conference on distributed computing and networking (ICDCN’13), Mumbai. LNCS, vol 7730. Springer, pp 225–239
Biely M, Robinson P, Schmid U (2012) Agreement in directed dynamic networks. In: Proceedings of the 19th international colloquium on structural information and communication complexity (SIROCCO’12), Reykjavik. LNCS, vol 7355. Springer, pp 73–84
Casteigts P, Flocchini P, Godard E, Santoro N, Yamashita M (2013) Expressivity of time-varying graphs. In: Proceedings of the 19th international symposium on fundamentals of computation theory (FST’13), Liverpool. LNCS, vol 8070. Springer, pp 95–106
Chandra T, Hadzilacos V, Toueg S (1996) The weakest failure detector for solving consensus. J ACM 43(4):685–722
Charron-Bost B, Schiper A (2009) The heard-of model: computing in distributed systems with benign faults. Distrib Comput 22(1):49–71
Coulouma E, Godard E (2013) A characterization of dynamic networks where consensus is solvable. In: Proceedings of the 19th international colloquium on structural information and communication complexity (SIROCCO’13), Ischia. LNCS, vol 8179. Springer, pp 24–35
Delporte-Gallet C, Fauconnier H, Guerraoui R (2010) Tight failure detection bounds on atomic object implementations. J ACM 57(4):Article 22
Godard E, Peters GP (2011) Consensus vs broadcast in communication networks with arbitrary mobile omission faults. In: Proceedings of the 17th international colloquium on structural information and communication complexity (SIROCCO’11), Gdansk. LNCS, vol 6796. Springer, pp 29–41
Herlihy M, Rajsbaum S, Raynal M, Stainer J (2014) Computing in the presence of concurrent solo executions. In: Proceedings of the 11th Latin-American theoretical informatics symposium (LATIN’2014), Montevideo. LNCS, vol 8392. Springer, pp 214–225
Herlihy MP, Shavit N (1999) The topological structure of asynchronous computability. J ACM 46(6):858–923
Kuhn F, Lynch NA, Oshman R (2010) Distributed computation in dynamic networks. In: Proceedings of the 42nd ACM symposium on theory of computing (STOC’10), Cambridge. ACM, pp 513–522
Moses Y, Rajsbaum S (2002) A layered analysis of consensus. SIAM J Comput 31:989–1021
Raynal M (2010) Fault-tolerant agreement in synchronous message-passing systems. Morgan & Claypool Publishers, 165p. ISBN:978-1-60845-525-6
Raynal M, Stainer J (2013) Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors. In: Proceedings of the 32nd ACM symposium on principles of distributed computing (PODC ’13), Montréal. ACM, pp 166–175
Santoro N, Widmayer P (1989) Time is not a healer. In: Proceedings of the 6th annual symposium on theoretical aspects of computer science (STACS’89), Paderborn. LNCS, vol 349. Springer, pp 304–316
Santoro N, Widmayer P (2007) Agreement in synchronous networks with ubiquitous faults. Theor Comput Sci 384(2–3):232–249
Schmid U, Weiss B, Keidar I (2009) Impossibility results and lower bounds for consensus under link failures. SIAM J Comput 38(5):1912–1951
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Raynal, M. (2016). Message Adversaries. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_609
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_609
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering