Brief announcement: Approximate Agreement under Mobile Byzantine Faults Model

This paper considers the Approximate Agreement problem in presence of mobile Byzantine agents. We prove lower bounds on the number of correct processes to solve such problem. To do that we prove that the existing solutions tolerant to Byzantine agents still holds in such case and under which conditions.

Domains

Distributed, Parallel, and Cluster Computing [cs.DC] Computational Complexity [cs.CC] Data Structures and Algorithms [cs.DS] Networking and Internet Architecture [cs.NI] Performance [cs.PF]

Sébastien Tixeuil : Connect in order to contact the contributor

https://hal.sorbonne-universite.fr/hal-01349092

Submitted on : Tuesday, July 26, 2016-4:34:17 PM

Last modification on : Tuesday, August 27, 2024-12:47:05 PM

Dates and versions

hal-01349092 , version 1 (26-07-2016)

Identifiers

HAL Id : hal-01349092 , version 1
ARXIV : 1604.03871
DOI : 10.1109/ICDCS.2016.68

Cite

Silvia Bonomi, Antonella del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil. Brief announcement: Approximate Agreement under Mobile Byzantine Faults Model. IEEE Conference on Distributed Computing Systems (ICDCS 2016), Jun 2016, Nara, Japan. IEEE, pp.727-728, ⟨10.1109/ICDCS.2016.68⟩. ⟨hal-01349092⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UPMC CNRS INRIA LIP6 SORBONNE-UNIVERSITE SU-SCIENCES

347 View

0 Download