DocumentCode
3055134
Title
Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks
Author
Greve, Fabíola ; Tixeuil, Sébastien
Author_Institution
Fed. Univ. of Bahia, Bahia
fYear
2007
fDate
25-28 June 2007
Firstpage
82
Lastpage
91
Abstract
In self-organizing systems, such as mobile ad-hoc and peer-to-peer networks, consensus is a fundamental building block to solve agreement problems. It contributes to coordinate actions of nodes distributed in an ad-hoc manner in order to take consistent decisions. It is well known that in classical environments, in which entities behave asynchronously and where identities are known, consensus cannot be solved in the presence of even one process crash. It appears that self-organizing systems are even less favorable because the set and identity of participants are not known. We define necessary and sufficient conditions under which fault-tolerant consensus become solvable in these environments. Those conditions are related to the synchrony requirements of the environment, as well as the connectivity of the knowledge graph constructed by the nodes in order to communicate with their peers.
Keywords
ad hoc networks; peer-to-peer computing; fault-tolerant agreement; knowledge connectivity; knowledge graph; mobile ad-hoc networks; peer-to-peer networks; synchrony requirements; Ad hoc networks; Computer crashes; Computer science; Detectors; Fault tolerance; Network topology; Peer to peer computing; Protocols; Sufficient conditions; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable Systems and Networks, 2007. DSN '07. 37th Annual IEEE/IFIP International Conference on
Conference_Location
Edinburgh
Print_ISBN
0-7695-2855-4
Type
conf
DOI
10.1109/DSN.2007.61
Filename
4272958
Link To Document