Sciweavers

2276 search results - page 65 / 456
» Failure of A Mix Network
Sort
View
SPAA
2009
ACM
16 years 1 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
104
Voted
IM
2003
15 years 2 months ago
Using Neural Networks to Identify Control and Management Plane Poison Messages
: Poison message failure propagation is a mechanism that has been responsible for large scale failures in both telecommunications and IP networks: Some or all of the network elemen...
Xiaojiang Du, Mark A. Shayman, Ronald A. Skoog
SPAA
2009
ACM
15 years 7 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
94
Voted
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
15 years 7 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
PODC
2004
ACM
15 years 6 months ago
Asynchronous group key exchange with failures
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Christian Cachin, Reto Strobl