Combining Different Failure Detectors for Solving a Large-Scale Consensus Problem
Haddad, Serge; Nguilla, François (1999), Combining Different Failure Detectors for Solving a Large-Scale Consensus Problem, in Lee, Roger Y., Computers and Their Applications (CATA-99), Proceedings of the ISCA 14th International Conference, Cancun, Mexico, April 7-9, 1999, ISCA, p. 204-209
TypeCommunication / Conférence
Conference title14th International Conference on Computers and Their Applications (CATA-99)
Book titleComputers and Their Applications (CATA-99), Proceedings of the ISCA 14th International Conference, Cancun, Mexico, April 7-9, 1999
Book authorLee, Roger Y.
MetadataShow full item record
Abstract (EN)Dependable services in distributed systems rely on some kind of agreement. Such an agreement can be obtained by solving the consensus problem. Most of the proposed consensus' algorithms are based on mutual knowledge of the participants and thus inadequate to wide area networks (WANs). In previous papers, we proposed protocols which deal with WANs constituted of interconnected physical groups of machines (LANs/domains). These protocols rely on Chandra and Toueg' unreliable failure detectors model for asynchronous systems extended to handle broadcast addresses and safeness of a whole subnet. Nevertheless, we assumed the same characteristics for local and distant failure detectors. In the present paper, we propose a new algorithm which takes into account a different behavior for the detectors. More precisely, local detectors behave as the S class of Chandra and Toueg and so are more reliable than the distant detectors which behave as the \PiS class. Moreover, the distant failure detector we dene, has the ability to test the failure of a local network via a broadcast address. We prove the correctness of the new algorithm and give some implementations hints in the Internet context.
Subjects / KeywordsUnreliable Failure Detectors; WAN
Showing items related by title and author.
Benders decomposition for very large scale partial set covering and maximal covering location problems Cordeau, Jean-François; Furini, Fabio; Ljubić, Ivana (2019) Article accepté pour publication ou publié
An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment Ribeiro, Celso Carneiro; Minoux, Michel; Penna, Manoel Camillo (1989) Article accepté pour publication ou publié