WDAG
2005
Springer
13 years 9 months ago
2005
Springer
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
WDAG
2005
Springer
13 years 9 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
WDAG
2005
Springer
13 years 9 months ago
2005
Springer
WDAG
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow...
WDAG
2005
Springer
13 years 9 months ago
2005
Springer
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...
WDAG
2005
Springer
13 years 9 months ago
2005
Springer
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 ...
WDAG
2005
Springer
13 years 9 months ago
2005
Springer
WDAG
2005
Springer
13 years 9 months ago
2005
Springer
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...