Sciweavers

28 search results - page 3 / 6
» wdag 2005
Sort
View
WDAG
2005
Springer
88views Algorithms» more  WDAG 2005»
13 years 10 months ago
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
We analyze the problem of efficient distributed storage of information in a message-passing environment where both less than one third of the servers, as well as an arbitrary num...
Christian Cachin, Stefano Tessaro
WDAG
2005
Springer
108views Algorithms» more  WDAG 2005»
13 years 10 months ago
Optimistic Generic Broadcast
Atomic Broadcast, used for example in state machine replication, requires three communication steps. Optimistic Atomic Broadcast requires only two steps if all processes receive m...
Piotr Zielinski
WDAG
2005
Springer
101views Algorithms» more  WDAG 2005»
13 years 10 months ago
Keeping Denial-of-Service Attackers in the Dark
Abstract. We consider the problem of overcoming (Distributed) Denial of Service (DoS) attacks by realistic adversaries that can eavesdrop on messages, or parts thereof, but with so...
Gal Badishi, Amir Herzberg, Idit Keidar
WDAG
2005
Springer
82views Algorithms» more  WDAG 2005»
13 years 10 months ago
Distributed Transactional Memory for Metric-Space Networks
Transactional Memory is a concurrent programming API in which concurrent threads synchronize via transactions (instead of locks). Although this model has mostly been studied in the...
Maurice Herlihy, Ye Sun
WDAG
2005
Springer
102views Algorithms» more  WDAG 2005»
13 years 10 months ago
Papillon: Greedy Routing in Rings
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku