Maximum metric spanning tree made Byzantine tolerant

DOI10.1007/s00453-014-9913-5zbMath1319.68026arXiv1104.5368OpenAlexW2147906479MaRDI QIDQ494938

Sébastien Tixeuil, Swan Dubois, Toshimitsu Masuzawa

Publication date: 3 September 2015

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

Full work available at URL: https://arxiv.org/abs/1104.5368

zbMATH Keywords

stabilizationfault tolerancedistributed computingself-stabilizationdistributed protocolByzantine faultByzantine tolerancemaximizable metricspanning tree construction

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (4)

Self-stabilizing systems in spite of high dynamics ⋮ Self-stabilizing Byzantine asynchronous unison ⋮ Maximum metric spanning tree made Byzantine tolerant ⋮ Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps

Cites Work

• Unnamed Item
• A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
• Maximum metric spanning tree made Byzantine tolerant
• Self-stabilizing minimum degree spanning tree within one from the optimal degree
• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilization of dynamic systems assuming only read/write atomicity
• The Steiner problem in distributed computing systems
• Self-stabilizing depth-first search
• A self-stabilizing algorithm for the shortest path problem in a distributed system
• Self-stabilization with path algebra
• THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• The Impact of Topology on Byzantine Containment in Stabilization
• The Byzantine Generals Problem
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Self-stabilizing systems in spite of distributed control
• Self-stabilizing token circulation in uniform networks
• Self-stabilizing depth-first token circulation in arbitrary rooted networks
• Self-stabilization with r-operators
• Self-stabilization of Byzantine Protocols
• Self-stabilization with r-Operators Revisited

This page was built for publication: Maximum metric spanning tree made Byzantine tolerant