Reducing the number of messages in self-stabilizing protocols

DOI10.1007/978-3-030-34992-9_12MaRDI QIDQ6536331zbMATH OpenFDO

Authors Anaïs Durand, Shay Kutten

Publication date 19 April 2024

zbMATH Keywords

fault-toleranceself-stabilizationtermination detectionmessage complexityquiescence detection

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Self-stabilization over unreliable communication media
• Low communication self-stabilization through randomization
• Message-efficient self-stabilizing transformer using snap-stabilizing quiescence detection
• Resource Bounds for Self-Stabilizing Message-Driven Protocols
• Self-stabilizing extensions for message-passing systems

Cites work

• scientific article; zbMATH DE number 3744520 (Why is no real title available?)
• An example of stepwise refinement of distributed programs: quiescence detection
• Bounded-wait combining: constructing robust and high-throughput shared objects
• Distributed Termination
• Proof labeling schemes
• Self-Stabilization by Counter Flushing
• Self-stabilization
• Self-stabilizing extensions for message-passing systems
• Self-stabilizing systems in spite of distributed control
• Snap-stabilization in message-passing systems
• Snap-stabilizing PIF on arbitrary connected networks in message passing model
• Termination detection for diffusing computations
• The expressive power of snap-stabilization
• The local detection paradigm and its applications to self-stabilization
• Time optimal self-stabilizing synchronization
• When graph theory helps self-stabilization

Cited in

(1)

• Communication efficient self-stabilizing leader election

This page was built for publication: Reducing the number of messages in self-stabilizing protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536331)