Sciweavers

OPODIS
2007
14 years 12 days ago
Making Distributed Applications Robust
We present a novel translation of systems that are tolerant of crash failures to systems that are tolerant of Byzantine failures in an asynchronous environment, making weaker assum...
Chi Ho, Danny Dolev, Robbert van Renesse
OPODIS
2007
14 years 12 days ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
OPODIS
2007
14 years 12 days ago
Deterministic Communication in the Weak Sensor Model
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
Antonio Fernández Anta, Miguel A. Mosteiro,...
OPODIS
2007
14 years 12 days ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
OPODIS
2007
14 years 12 days ago
ASAP: A Camera Sensor Network for Situation Awareness
Situation awareness is an important application category in cyber-physical systems, and distributed video-based surveillance is a good canonical example of this application class. ...
JunSuk Shin, Rajnish Kumar, Dushmanta Mohapatra, U...
OPODIS
2007
14 years 12 days ago
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...
OPODIS
2007
14 years 12 days ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...
OPODIS
2007
14 years 12 days ago
Secretive Birds: Privacy in Population Protocols
We study private computations in a system of tiny mobile agents. We consider the mobile population protocol model of Angluin et al. [2] and ask what can be computed without ever re...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...