Sciweavers

184 search results - page 20 / 37
» Communication in Networks with Random Dependent Faults
Sort
View
SAC
2006
ACM
15 years 3 months ago
Proactive resilience through architectural hybridization
In a recent work, we have shown that it is not possible to dependably build any type of distributed f fault or intrusiontolerant system under the asynchronous model. This result f...
Paulo Sousa, Nuno Ferreira Neves, Paulo Verí...
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
15 years 10 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
15 years 2 months ago
Pinpoint: Problem Determination in Large, Dynamic Internet Services
Traditional problem determination techniques rely on static dependency models that are difficult to generate accurately in today’s large, distributed, and dynamic application e...
Mike Y. Chen, Emre Kiciman, Eugene Fratkin, Armand...
DSN
2002
IEEE
15 years 2 months ago
Secure Intrusion-tolerant Replication on the Internet
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
Christian Cachin, Jonathan A. Poritz
85
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
A Mobility Prediction-Based Adaptive Data Gathering Protocol for Delay Tolerant Mobile Sensor Network
— The basic operation of Delay Tolerant Mobile Sensor Network (DTMSN) is for pervasive data gathering in networks with intermittent connectivity, where traditional data gathering...
Jinqi Zhu, Jiannong Cao, Ming Liu, Yuan Zheng, Hai...