• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

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

View/Open
combining_different.PDF (185.1Kb)
Type
Communication / Conférence
Date
1999
Conference title
14th International Conference on Computers and Their Applications (CATA-99)
Conference date
1999-04
Conference city
Cancun
Conference country
Mexique
Book title
Computers and Their Applications (CATA-99), Proceedings of the ISCA 14th International Conference, Cancun, Mexico, April 7-9, 1999
Book author
Lee, Roger Y.
Publisher
ISCA
ISBN
1-880843-27-7
Pages
204-209
Metadata
Show full item record
Author(s)
Haddad, Serge
Nguilla, François
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 / Keywords
Unreliable Failure Detectors; WAN

Related items

Showing items related by title and author.

  • Thumbnail
    A consensus protocol for wide area networks 
    El Fallah Seghrouchni, Amal; Haddad, Serge; Nguilla, François (1998) Communication / Conférence
  • Thumbnail
    Stochastic Optimization for Large-scale Optimal Transport 
    Genevay, Aude; Cuturi, Marco; Peyré, Gabriel; Bach, Francis (2016) Communication / Conférence
  • Thumbnail
    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é
  • Thumbnail
    Large-scale indexing of spatial data in distributed repositories: the SD-Rtree 
    Rigaux, Philippe; Litwin, Witold; du Mouza, Cédric (2009) Article accepté pour publication ou publié
  • Thumbnail
    Fast User Notification in Large-Scale Digital Librairies: Experiments and Results 
    Belhaj Frej, Hanen; Rigaux, Philippe; Spyratos, Nicolas (2007) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo