Sciweavers

464 search results - page 80 / 93
» A Fault Tolerance Protocol with Fast Fault Recovery
Sort
View
SRDS
1998
IEEE
13 years 11 months ago
AQuA: An Adaptive Architecture that Provides Dependable Distributed Objects
Dependable distributed systems are difficult to build. This is particularly true if they have dependability requirements that change during the execution of an application, and are...
Michel Cukier, Jennifer Ren, Chetan Sabnis, David ...
HPDC
2010
IEEE
13 years 8 months ago
Detouring and replication for fast and reliable internet-scale stream processing
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
14 years 7 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
DSN
2002
IEEE
14 years 15 days ago
Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done ...
Andrea Coccoli, Péter Urbán, Andrea ...
WCNC
2008
IEEE
14 years 1 months ago
Arbutus: Network-Layer Load Balancing for Wireless Sensor Networks
—The hot spot problem is a typical byproduct of the many-to-one traffic pattern that characterizes most wireless sensor networks: the nodes with the best channel to the sink are ...
Daniele Puccinelli, Martin Haenggi