Principles of Distributed Systems

DOI10.1007/B138689MaRDI QIDQ5713675zbMATH OpenOpenAlexFDO

Authors Yusuke Sakurai, Fukuhito Ooshita, Toshimitsu Masuzawa

Publication date 15 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b138689

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Recommendations

• Self-stabilization of Byzantine Protocols
• The impact of topology on Byzantine containment in stabilization
• Self-stabilization and Byzantine tolerance for maximal matching

Cited in

(8)

• Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps
• Self-stabilizing Byzantine asynchronous unison
• Distributed edge coloration for bipartite networks
• The impact of topology on Byzantine containment in stabilization
• A self-stabilizing algorithm for the st-order problem
• A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault

This page was built for publication: Principles of Distributed Systems

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