NDLI: Agreement and consistency without knowing the number of processes

Please wait, while we are loading the content...

$LH*_{RS}^{P2P}:$ a scalable distributed data structure for P2P environment

On the reputation of communities of web services

Extending orchids for intrusion detection in 802.11 wireless networks

Adding a methodological assistant to a protocol modeling environment

A secure peer-to-peer backup system

Content-based communication in disconnected mobile ad hoc networks

P2P logging and timestamping for XWiki

Agent based approach for distribution of fingerprint matching in a metacomputing environment

Software architecture for dynamic adaptation of heterogeneous applications

Modelling collaborative workflows using recursive ECATNets

Development of semantic web services: model driven approach

A dynamic approach to consistency management for mobile multiplayer games

Virtual base station election for wireless sensor networks

A location service for position-based routing in mobile ad hoc networks

Swiss Experiment: from wireless sensor networks to e-science

SAWSDL, mediation and XQUERY for web services discovery

Automatic classification of security messages based on text categorization

Discovering protocols and organizational structures in workflows

From cells to organisms: long-term guarantees on service provisioning in peer-to-peer networks

A power-aware middleware for mobile ad-hoc networks

Monte Carlo simulation with the GATE software using grid computing

DOC: a new multi-agent approach for DCSP resolution

An automatic transformation from COSA software architecture to CORBA platform

Modeling of information system correlated events time dependencies

Decentralized concurrency control for real-time collaborative editors

Using structured and segmented data for improving data sharing on MANETs

Consistency of sensor data in presence of updates

Agreement without knowing everybody: a first step to dynamicity

Web services: the story so far - an academic and industrial account

CWSC4EC: how to employ context, web service, and community in enterprise collaboration

A meta-level architecture for QoS awareness in a mobile environment

Optimal tester synthesis for real-time systems

A policy-based context-aware approach for the commitment of mobile transactions

Contextual service loading by dependency graph colouring

A distributed and cooperative semantic system for geographic information management

Mercury: a platform for the execution of multiagent systems

Enhanced connectors to support hierarchical dependencies in software architecture

Agreement and consistency without knowing the number of processes

Data sharing over mobile ad hoc networks

Real time data consistency in component based embedded systems

Preserving the consistency of distributed objects with real-time transactions

Management of data sources and services in pervasive environments

A network and QoE aware P2P video streaming solution

Incidence of the improvement of the transport: MAC protocols interactions on MANET performance

Formal verification of WAHS: an autonomous and wireless P2P auction handling system

A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks

TTool for DIPLODOCUS: an environment for design space exploration

A self-adaptive query service for pervasive environments

Collective intelligence for demand-responsive transportation systems: a self organization model

EERP: energy-efficient routing protocol for wireless sensor networks

Agreement and consistency without knowing the number of processes

Content Provider	ACM Digital Library
Author	Abboud, Mohssen Fauconnier, Hugues Delporte-Gallet, Carole
Abstract	We study in this paper three classical problems of fault tolerance in a system where the set of processes is unknown. These three problems are: the consensus, the implementation of atomics registers and the eventual leader election. For this, we consider different models. In the first one, the communication and the processes are asynchronous. In this model, these three problems could not be solved, but we define the weakest failure detectors needed to solve them. We consider then a model where the processes and the communication are synchronous, which permit to realize synchronous rounds. In this case, the processes are created dynamically and may have crash failures. We prove that, if for all rounds at least one process is alive in two consecutive rounds, the consensus and the implementation of registers could be solved. The eventual leader election, which is in this case less interesting, can be solved also. Between these two extremities, we focus on the case where the communications are asynchronous. Concerning processes, we assume that, onetime a process is created, it remains alive forever. In this case, if the leader election is easy, the consensus and the implementation of registers are impossible. If we augment the system with the failure detector (Σ) which permits to realize a quorum, consensus and implementation of atomic register can be solved. At the end, we consider a partially synchronous model and we prove that the consensus and the implementation of atomic register could be solved if there exists a process that can communicate synchronously with the other processes.
Starting Page	1
Ending Page	8
Page Count	8
File Format	PDF
ISBN	9781595939371
DOI	10.1145/1416729.1416777
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2008-06-23
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Fault tolerance Dynamic systems Distributed algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Agreement without knowing everybody: a first step to dynamicity

Agreement and consistency without knowing the number of processes.

Consistency and fault tolerance for erasure-coded distributed storage systems

A Characterization of Eventual Byzantine Agreement

The anatomy study of efficient agreement in a cloud computing environment with fallible processes

Scalable consistency in Scatter

The Degree of Masking Fault Tolerance vs. Temporal Redundancy

A Byzantine Fault Tolerant Distributed Commit Protocol

A Distributed Algorithm For Fault-tolerant Dynamic Task Scheduling

Agreement and consistency without knowing the number of processes

Similar Documents

Agreement without knowing everybody: a first step to dynamicity

Agreement and consistency without knowing the number of processes.

Consistency and fault tolerance for erasure-coded distributed storage systems

A Characterization of Eventual Byzantine Agreement

The anatomy study of efficient agreement in a cloud computing environment with fallible processes

Scalable consistency in Scatter

The Degree of Masking Fault Tolerance vs. Temporal Redundancy

A Byzantine Fault Tolerant Distributed Commit Protocol

A Distributed Algorithm For Fault-tolerant Dynamic Task Scheduling

Agreement and consistency without knowing the number of processes