Sciweavers

313 search results - page 11 / 63
» Computing synchronizer failure probabilities
Sort
View
GI
2003
Springer
15 years 5 months ago
Byzantine Failures and Security: Arbitrary is not (always) Random
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...
Felix C. Gärtner
SPDP
1993
IEEE
15 years 3 months ago
Group Membership in a Synchronous Distributed System
This paper presents a solution to the (processor) group membership problem. The methodology followed in designing the algorithm is summarized by the option to optimize the perform...
Gianluigi Alari, Augusto Ciuffoletti
COLCOM
2008
IEEE
15 years 6 months ago
Data Quality and Failures Characterization of Sensing Data in Environmental Applications
Environmental monitoring is one of the most important sensor network application domains. The success of those applications is determined by the quality of the collected data. Thu...
Kewei Sha, Guoxing Zhan, Safwan Al-Omari, Tim Cala...
IPPS
2007
IEEE
15 years 6 months ago
Almost Peer-to-Peer Clock Synchronization
In this paper, an almost peer-to-peer (AP2P) clock synchronization protocol is proposed. AP2P is almost peer-topeer in the sense that it provides the desirable features of a purel...
Ahmed Sobeih, Michel Hack, Zhen Liu, Li Zhang
ICDCN
2010
Springer
15 years 6 months ago
Authenticated Byzantine Generals in Dual Failure Model
Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BG...
Anuj Gupta, Prasant Gopal, Piyush Bansal, Kannan S...