Sciweavers

219 search results - page 28 / 44
» Byzantine Quorum Systems
Sort
View
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
14 years 1 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
ICDCS
2006
IEEE
14 years 3 months ago
Sharing Memory between Byzantine Processes using Policy-Enforced Tuple Spaces
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...
Alysson Neves Bessani, Joni da Silva Fraga, Miguel...
CORR
2006
Springer
85views Education» more  CORR 2006»
13 years 10 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
ICDCS
2010
IEEE
14 years 1 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...
DSE
1998
80views more  DSE 1998»
13 years 9 months ago
The Voltan application programming environment for fail-silent processes
The Voltan software library for building distributed applications provides the support for (i) a processpair to act as single Voltan self-checking ‘fail-silent’ process; and (...
Dave Black, C. Low, Santosh K. Shrivastava