Skip to main content

Part of the book series: Synthesis Lectures on Distributed Computing Theory ((SLDCT))

  • 50 Accesses

Abstract

In the rest of the book, we will present topological conditions that have appeared in the literature and affect consensus feasibility in different settings than the ones addressed up to this point. We will consider different adversary models and level of topology knowledge as well as more fundamental reliable communication problems, the feasibility of which naturally affects consensus solvability. All results presented are studied in the context of the synchronous message-passing model.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Cite this chapter

Sakavalas, D., Tseng, L. (2019). Broadcast Under Local Adversaries. In: Network Topology and Fault-Tolerant Consensus. Synthesis Lectures on Distributed Computing Theory. Springer, Cham. https://doi.org/10.1007/978-3-031-02014-8_7

Download citation

Publish with us

Policies and ethics