Sciweavers

Share
OPODIS
2004
9 years 8 months ago
Optimal Resilience Asynchronous Approximate Agreement
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
Ittai Abraham, Yonatan Amit, Danny Dolev
OPODIS
2004
9 years 8 months ago
Directional Versus Omnidirectional Antennas for Energy Consumption and k-Connectivity of Networks of Sensors
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
Evangelos Kranakis, Danny Krizanc, Eric Williams
OPODIS
2007
9 years 8 months ago
Self-stabilizing and Byzantine-Tolerant Overlay Network
Network overlays have been the subject of intensive research in recent years. The paper presents an overlay structure, S-Fireflies, that is self-stabilizing and is robust against ...
Danny Dolev, Ezra N. Hoch, Robbert van Renesse
OPODIS
2007
9 years 8 months ago
Clock Synchronization in the Byzantine-Recovery Failure Model
Abstract. We consider the problem of synchronizing clocks in synchronous systems prone to transient and dynamic process failures, i.e., we consider systems where all processes may ...
Emmanuelle Anceaume, Carole Delporte-Gallet, Hugue...
OPODIS
2007
9 years 8 months ago
Timed Quorum Systems for Large-Scale and Dynamic Environments
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are...
Vincent Gramoli, Michel Raynal
OPODIS
2007
9 years 8 months 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
9 years 8 months 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
9 years 8 months 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
9 years 8 months 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
books