Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2007-01-03
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
We consider the problem of failure detection in dynamic networks such as MANETs. Unreliable failure detectors are classical mechanisms which provide information about process failures. However, most of current implementations consider that the network is fully connected and that the initial number of nodes of the system is known. This assumption is not applicable to dynamic environments. Furthermore, such implementations are usually timer-based while in dynamic networks there is no upper bound for communication delays since nodes can move. This paper presents an asynchronous implementation of a failure detector for unknown and mobile networks. Our approach does not rely on timers and neither the composition nor the number of nodes in the system are known. We prove that our algorithm can implement failure detectors of class <>S when behavioral properties and connectivity conditions are satisfied by the underlying system.
Arantes Luciana
Bouillaguet Mathieu
Greve Fabiola
Martin Véronique
Sens Pierre
No associations
LandOfFree
Asynchronous Implementation of Failure Detectors with partial connectivity and unknown participants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Asynchronous Implementation of Failure Detectors with partial connectivity and unknown participants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asynchronous Implementation of Failure Detectors with partial connectivity and unknown participants will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-563659