The byzantine brides problem

Authors:
Swan Dubois;Sébastien Tixeuil;Nini Zhu
Affiliations:
UPMC Sorbonne Universités & Inria, France;UPMC Sorbonne Universités & Institut Universitaire de France, France;UPMC Sorbonne Universités, France
Venue:
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Year:
2012

Citing 16
Cited 1

A self-stabilizing algorithm for maximal matching

Information Processing Letters
Maximal matching stabilizes in quadratic time

Information Processing Letters
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Self-stabilization

Self-stabilization
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Tolerance to Unbounded Byzantine Faults

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Efficient Self-stabilizing Algorithms for Tree Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Self-stabilizing clock synchronization in the presence of Byzantine faults

Journal of the ACM (JACM)
A new self-stabilizing maximal matching algorithm

Theoretical Computer Science
Self-stabilizing algorithms

Algorithms and theory of computation handbook
The impact of topology on Byzantine containment in stabilization

DISC'10 Proceedings of the 24th international conference on Distributed computing
On byzantine containment properties of the min + 1 protocol

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
A self-stabilizing 23-approximation algorithm for the maximum matching problem

Theoretical Computer Science
Self-stabilization of byzantine protocols

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems

Research note: Self-stabilizing byzantine asynchronous unison

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the hardness of establishing as many stable marriages (that is, marriages that last forever) in a population whose memory is placed in some arbitrary state with respect to the considered problem, and where traitors try to jeopardize the whole process by behaving in a harmful manner. On the negative side, we demonstrate that no solution that is completely insensitive to traitors can exist, and we propose a protocol for the problem that is optimal with respect to the traitor containment radius.