Byzantine reliable broadcast in sparse networks

Sisi Duan, Lucas Nicely, Haibin Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

Modern large-scale networks require the ability to withstand arbitrary failures (i.e., Byzantine failures). Byzantine reliable broadcast algorithms can be used to reliably disseminate information in the presence of Byzantine failures.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE 15th International Symposium on Network Computing and Applications, NCA 2016
EditorsDimiter R. Avresky, Aris Gkoulalas-Divanis, Pierangelo Di Sanzo, Dimiter R. Avresky, Alessandro Pellegrini
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages175-182
Number of pages8
ISBN (Electronic)9781509032167
DOIs
Publication statusPublished - 8 Dec 2016
Externally publishedYes
Event15th IEEE International Symposium on Network Computing and Applications, NCA 2016 - Cambridge, United States
Duration: 30 Oct 20162 Nov 2016

Publication series

NameProceedings - 2016 IEEE 15th International Symposium on Network Computing and Applications, NCA 2016

Conference

Conference15th IEEE International Symposium on Network Computing and Applications, NCA 2016
Country/TerritoryUnited States
CityCambridge
Period30/10/162/11/16

Keywords

  • Byzantine broadcast
  • Fault detection
  • Fault tolerance
  • Reliable broadcast
  • Sparse networks

Fingerprint

Dive into the research topics of 'Byzantine reliable broadcast in sparse networks'. Together they form a unique fingerprint.

Cite this