@inproceedings{f8b23856bba245d2bd800efa5c1d18cf,
title = "The fault detection problem",
abstract = "One of the most important challenges in distributed computing is ensuring that services are correct and available despite faults. Recently it has been argued that fault detection can be factored out from computation, and that a generic fault detection service can be a useful abstraction for building distributed systems. However, while fault detection has been extensively studied for crash faults, little is known about detecting more general kinds of faults. This paper explores the power and the inherent costs of generic fault detection in a distributed system. We propose a formal framework that allows us to partition the set of all faults that can possibly occur in a distributed computation into several fault classes. Then we formulate the fault detection problem for a given fault class, and we show that this problem can be solved for only two specific fault classes, namely omission faults and commission faults. Finally, we derive tight lower bounds on the cost of solving the problem for these two classes in asynchronous message-passing systems.",
keywords = "Fault classes, Fault detection problem, Lower bounds, Message complexity",
author = "Andreas Haeberlen and Petr Kuznetsov",
year = "2009",
month = dec,
day = "31",
doi = "10.1007/978-3-642-10877-8\_10",
language = "English",
isbn = "3642108768",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "99--114",
booktitle = "Principles of Distributed Systems - 13th International Conference, OPODIS 2009, Proceedings",
note = "13th International Conference on Principles of Distributed Systems, OPODIS 2009 ; Conference date: 15-12-2009 Through 18-12-2009",
}