Search
Now showing items 1-4 of 4
Reliably Detecting Connectivity using Local Graph Traits
(2010-09-09)
Local distributed algorithms can only gather sufficient information to identify local graph traits, that is, properties that hold within the local neighborhood of each node. However, it is frequently the case that global ...
Keeping Mobile Robots Connected
(2009-06-17)
Designing robust algorithms for mobile agents with reliable communication is difficult due to the distributed nature of computation, in mobile ad hoc networks (MANETs) the matter is exacerbated by the need to ensure ...
Asynchronous Failure Detectors
(2013-01-30)
Failure detectors -- oracles that provide information about process crashes -- are an important abstraction for crash tolerance in distributed systems. The generality of failure-detector theory, while providing great ...
Asynchronous Failure Detectors
(2013-10-10)
Failure detectors -- oracles that provide information about process crashes -- are an important abstraction for crash tolerance in distributed systems. The generality of failure-detector theory, while providing great ...