Skip to main content
SpringerLink
Log in

Message Adversaries

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 35 Accesses

Years and Authors of Summarized Original Work

  • 1989; Santoro, Widmayer

Problem Definition: The Notion of a Message Adversary

Message adversaries have been introduced by N. Santoro and P. Widmayer in a paper titled Time is not a healer [15] to model and understand what they called dynamic transmission failures in the context of synchronous systems. Then, they extended their approach in [16] where they used the term ubiquitous failures. The terms heard-of communication [5], transient link failure [17], and mobile failure [12] have later been used by other authors to capture similar network behaviors in synchronous or asynchronous systems.

The aim of this approach is to consider message losses as a normal link behavior (as long as messages are correctly transmitted). The notion of a message adversary is of a different nature than the notion of the fair link assumption. A fair link assumption is an assumption on each link taken separately, while the message adversary notion considers the...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. 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

    Google Scholar 

  2. 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

    Google Scholar 

  3. 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

    Google Scholar 

  4. Chandra T, Hadzilacos V, Toueg S (1996) The weakest failure detector for solving consensus. J ACM 43(4):685–722

    Article  MathSciNet  MATH  Google Scholar 

  5. Charron-Bost B, Schiper A (2009) The heard-of model: computing in distributed systems with benign faults. Distrib Comput 22(1):49–71

    Article  MATH  Google Scholar 

  6. 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

    Google Scholar 

  7. Delporte-Gallet C, Fauconnier H, Guerraoui R (2010) Tight failure detection bounds on atomic object implementations. J ACM 57(4):Article 22

    Google Scholar 

  8. 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

    Google Scholar 

  9. 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

    Google Scholar 

  10. Herlihy MP, Shavit N (1999) The topological structure of asynchronous computability. J ACM 46(6):858–923

    Article  MathSciNet  MATH  Google Scholar 

  11. 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

    Chapter  Google Scholar 

  12. Moses Y, Rajsbaum S (2002) A layered analysis of consensus. SIAM J Comput 31:989–1021

    Article  MathSciNet  MATH  Google Scholar 

  13. Raynal M (2010) Fault-tolerant agreement in synchronous message-passing systems. Morgan & Claypool Publishers, 165p. ISBN:978-1-60845-525-6

    Google Scholar 

  14. 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

    Chapter  Google Scholar 

  15. 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

    Google Scholar 

  16. Santoro N, Widmayer P (2007) Agreement in synchronous networks with ubiquitous faults. Theor Comput Sci 384(2–3):232–249

    Article  MathSciNet  MATH  Google Scholar 

  17. Schmid U, Weiss B, Keidar I (2009) Impossibility results and lower bounds for consensus under link failures. SIAM J Comput 38(5):1912–1951

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Universitaire de France and IRISA, Université de Rennes, Campus de Beaulieu, 35042, Rennes, France

    Michel Raynal

Authors
  1. Michel Raynal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation