Sciweavers

136 search results - page 21 / 28
» A Theory for Observational Fault Tolerance
Sort
View
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
14 years 8 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
ACSAC
2007
IEEE
14 years 2 months ago
Countering False Accusations and Collusion in the Detection of In-Band Wormholes
Cooperative intrusion detection techniques for MANETs utilize ordinary computing hosts as network intrusion sensors. If compromised, these hosts may inject bogus data into the int...
Daniel Sterne, Geoffrey Lawler, Richard Gopaul, Br...
SIGMETRICS
2005
ACM
14 years 2 months ago
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
Derek Leonard, Vivek Rai, Dmitri Loguinov
IPPS
1997
IEEE
14 years 23 days ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
ISSRE
2007
IEEE
13 years 10 months ago
Towards Self-Protecting Enterprise Applications
Enterprise systems must guarantee high availability and reliability to provide 24/7 services without interruptions and failures. Mechanisms for handling exceptional cases and impl...
Davide Lorenzoli, Leonardo Mariani, Mauro Pezz&egr...