Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks

Simple item page
dc.creatorDaliot, Ariel
dc.creatorDolev, Danny
dc.creatorParnas, Hanna
dc.date2008-03-03
dc.date2008-03-04
dc.date.accessioned2026-07-07T09:24:21Z
dc.date.available2026-07-07T09:24:21Z
dc.descriptionWe define the ``Pulse Synchronization'' problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing systems. Pulse-coupled synchronization is a phenomenon displayed by a large variety of biological systems, typically overcoming a high level of noise. Inspired by such biological models, a robust and self-stabilizing Byzantine pulse synchronization algorithm for distributed computer systems is presented. The algorithm attains near optimal synchronization tightness while tolerating up to a third of the nodes exhibiting Byzantine behavior concurrently. Pulse synchronization has been previously shown to be a powerful building block for designing algorithms in this severe fault model. We have previously shown how to stabilize general Byzantine algorithms, using pulse synchronization. To the best of our knowledge there is no other scheme to do this without the use of synchronized pulses.
dc.descriptionThis is the full and revised version. A previous (obsolete) version appeared as TR2003-1, The Hebrew University of Jerusalem, 2003
dc.identifierhttps://arxiv.org/abs/0803.0241
dc.identifierhttp://arxiv.org/abs/0803.0241
dc.identifierIn Proceedings of the Sixth Symposium on Self-Stabilizing Systems (SSS'03), San Francisco, June 2003. See also LNCS 2704
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156066
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectC.1.4; C.2.4; D.4.5
dc.titleSelf-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks
dc.typetext

Files

Collections

arXiv