Self-Stabilizing Mobile Byzantine-Tolerant Regular Register with bounded timestampReportar como inadecuado

Self-Stabilizing Mobile Byzantine-Tolerant Regular Register with bounded timestamp - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 DIAG - Sapienza University of Rome 2 NPA - Networks and Performance Analysis LIP6 - Laboratoire d-Informatique de Paris 6 3 IUF - Institut Universitaire de France 4 LINCS - Laboratory of Information, Network and Communication Sciences

Abstract : This paper proposes the first implementation of a regular register by n servers that is tolerant to both mobile Byzantine agents, and transient failures it is self-stabilizing in a round-free synchronous model. We consider the most difficult model for mobile Byzantine agents to date where the message delay, δ, and the speed of mobile Byzantine agents, ∆, are completely decoupled. Moreover, servers are not aware of their state infected or correct after mobile Byzantine agents left them. The register is maintained by n servers and our algorithm tolerates i any number of transient failures , and ii up to f Mobile Byzantine agents. Our implementation uses bounded timestamps from the Z 5 domain, and is optimal with respect to the number of tolerated mobile Byzantine agents. The convergence time of our solution is upper bounded by 3∆ + T 5write , where T 5write is the time needed to execute five complete write operations.

Autor: Silvia Bonomi - Antonella Del Pozzo - Maria Potop-Butucaru - Sébastien Tixeuil -



Documentos relacionados