Geodesic stability for memoryless binary long-lived consensus
Discrete Mathematics
2011-02-22 v1 Distributed, Parallel, and Cluster Computing
Abstract
The determination of the stability of the long-lived consensus problem is a fundamental open problem in distributed systems. We concentrate on the memoryless binary case with geodesic paths. We offer a conjecture on the stability in this case, exhibit two classes of colourings which attain this conjectured bound, and improve the known lower bounds for all colourings. We also introduce a related parameter, which measures the stability only for certain geodesics, and for which we also prove lower bounds.
Cite
@article{arxiv.1102.4100,
title = {Geodesic stability for memoryless binary long-lived consensus},
author = {Cristina G. Fernandes and Maya Stein},
journal= {arXiv preprint arXiv:1102.4100},
year = {2011}
}