Self-Stabilizing Mobile Byzantine-Tolerant Regular Register with bounded timestamp

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.
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download
Contributor : Sébastien Tixeuil <>
Submitted on : Thursday, September 8, 2016 - 12:02:59 PM
Last modification on : Thursday, October 17, 2019 - 12:36:05 PM
Long-term archiving on : Friday, December 9, 2016 - 12:59:12 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License


  • HAL Id : hal-01362193, version 1
  • ARXIV : 1609.02694


Silvia Bonomi, Antonella del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil. Self-Stabilizing Mobile Byzantine-Tolerant Regular Register with bounded timestamp. [Research Report] UPMC - Université Paris 6 Pierre et Marie Curie; Sapienza Università di Roma (Italie). 2016. ⟨hal-01362193v1⟩



Record views


Files downloads