231 search results - page 13 / 47 » A Byzantine Fault Tolerant Distributed Commit Protocol |
103
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
120
click to vote
MDM
2007
Springer
15 years 10 months ago
2007
Springer
In traditional fixed-wired networks, standard protocols like 2-Phase-Commit are used to guarantee atomicity for distributed transactions. However, within mobile networks, a highe...
142
click to vote
DSN
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
250
click to vote
MDM
2010
Springer
15 years 8 months ago
2010
Springer
—The support of distributed atomic transactions in mobile ad-hoc networks (MANET) is a key requirement for many mobile application scenarios. Atomicity is a fundamental property ...
131
click to vote
EDCC
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we present a new fault tolerant clock synchronization algorithm called the Fault Tolerant Daisy Chain algorithm. It is intended for internal clock synchronization of...