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.

Domaines

Calcul parallèle, distribué et partagé [cs.DC] Complexité [cs.CC] Algorithme et structure de données [cs.DS] Réseaux et télécommunications [cs.NI] Performance et fiabilité [cs.PF]

Sébastien Tixeuil : Connectez-vous pour contacter le contributeur

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

Soumis le : mardi 26 juillet 2016-16:34:17

Dernière modification le : lundi 15 avril 2024-11:25:23

Dates et versions

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

Identifiants

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

Citer

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INSTITUT-TELECOM UPMC CNRS INRIA LIP6 SORBONNE-UNIVERSITE SU-SCIENCES

336 Consultations

0 Téléchargements