Sciweavers

271 search results - page 9 / 55
» Distributed Problem Solving In SPite Of Processor Failures
Sort
View
SIGCOMM
2005
ACM
14 years 28 days ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
DSN
2002
IEEE
14 years 10 days ago
A Realistic Look At Failure Detectors
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
WDAG
2010
Springer
218views Algorithms» more  WDAG 2010»
13 years 5 months ago
Anonymous Asynchronous Systems: The Case of Failure Detectors
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
François Bonnet, Michel Raynal
FGCS
2000
145views more  FGCS 2000»
13 years 7 months ago
Ant algorithms and stigmergy
Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organiz...
Marco Dorigo, Eric Bonabeau, Guy Theraulaz
DC
1999
13 years 7 months ago
A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
Michel Hurfin, Michel Raynal