Fault tolerant network constructors

DOI10.1007/978-3-030-34992-9_19zbMATH Open1539.68048MaRDI QIDQ6536337FDOQ6536337

Authors: Othon Michail, P. G. Spirakis, Michail Theofilatos Error creating thumbnail:

Publication date: 19 April 2024

Recommendations

• Construction of the mesh and the torus tolerating a large number of faults
• Sparse networks tolerating random faults.
• Efficient fault-tolerant routings in networks
• Network Constructors: A Model for Programmable Matter

zbMATH Keywords

fairnessself-organizationself-stabilizationdistributed protocolnetwork constructionfault-tolerant protocoldynamic graph formation

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 design and communication in computer systems (68M10) Network protocols (68M12)

Cites Work

• Computation in networks of passively mobile finite-state sensors
• Self-stabilization
• The computational power of population protocols
• Mediated population protocols
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Self-stabilization with \(r\)-operators
• On the transformation capability of feasible mechanisms for programmable matter
• Terminating distributed construction of shapes and patterns in a fair solution of automata
• On space complexity of self-stabilizing leader election in mediated population protocol
• Constructing self-stabilizing oscillators in population protocols
• Network Constructors: A Model for Programmable Matter

This page was built for publication: Fault tolerant network constructors

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