Sciweavers

WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
13 years 11 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
WDAG
2007
Springer
85views Algorithms» more  WDAG 2007»
13 years 11 months ago
Fully Distributed Algorithms for Convex Optimization Problems
Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
13 years 11 months ago
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...
Bilel Derbel, Cyril Gavoille, David Peleg
WDAG
2007
Springer
102views Algorithms» more  WDAG 2007»
13 years 11 months ago
A Denial-of-Service Resistant DHT
We consider the problem of designing scalable and robust information systems based on multiple servers that can survive even massive denial-of-service (DoS) attacks. More precisely...
Baruch Awerbuch, Christian Scheideler
WDAG
2007
Springer
68views Algorithms» more  WDAG 2007»
13 years 11 months ago
Push-to-Pull Peer-to-Peer Live Streaming
In contrast to peer-to-peer file sharing, live streaming based on peer-to-peer technology is still awaiting its breakthrough. This may be due to the additional challenges live str...
Thomas Locher, Remo Meier, Stefan Schmid, Roger Wa...
WDAG
2007
Springer
84views Algorithms» more  WDAG 2007»
13 years 11 months ago
Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks
Roberto Baldoni, Kleoni Ioannidou, Alessia Milani
WDAG
2007
Springer
103views Algorithms» more  WDAG 2007»
13 years 11 months ago
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
Michael G. Merideth, Michael K. Reiter
WDAG
2007
Springer
128views Algorithms» more  WDAG 2007»
13 years 11 months ago
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
Abstract. This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms,...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...
WDAG
2007
Springer
63views Algorithms» more  WDAG 2007»
13 years 11 months ago
A Formal Analysis of the Deferred Update Technique
The deferred update technique is a widely used approach for building replicated database systems. Its fame stems from the fact that read-only transactions can execute locally to a...
Rodrigo Schmidt, Fernando Pedone
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
13 years 11 months ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat