Sciweavers

67 search results - page 3 / 14
» Achieving Fault-Tolerant Ordered Broadcasts in CAN
Sort
View
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
15 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
97
Voted
CCS
2007
ACM
15 years 3 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
CIKM
2010
Springer
14 years 7 months ago
Adaptive query execution for data management in the cloud
A major component of many cloud services is query processing on data stored in the underlying cloud cluster. The traditional techniques for query processing on a cluster are those...
Adrian Daniel Popescu, Debabrata Dash, Verena Kant...
RANDOM
1998
Springer
15 years 1 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
SRDS
1999
IEEE
15 years 1 months ago
Enforcing Determinism for the Consistent Replication of Multithreaded CORBA Applications
In CORBA-based applications that depend on object replication for fault tolerance, inconsistencies in the states of the replicas of an object can arise when concurrent threads wit...
Priya Narasimhan, Louise E. Moser, P. M. Melliar-S...