Design of fault-tolerant clocks with realistic failure assumptions

Vasanthavada, N.; Thambidurai, P.; Marinos, P.N.

doi:10.1109/ftcs.1989.105555

Cited by 5 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For [5] Fault Tol. [26], and setting s = b = 0 yields the single-mode Byzantine fault model. Table I compares the convergence rates of all algorithms analyzed herein for the three-mode fault model and the singlemode fault model.…”

Section: Discussionmentioning

confidence: 99%

“…In the context of Approximate Agreement, Vasanthavada et al used a similar two-mode fault model containing only symmetric and asymmetric faults in an ad hoc study of three hardware-based clock synchronization algorithms [26]. However, the general Approximate Agreement problem has not been examined under the three-mode fault model.…”

Section: A Three-mode Fault Modelmentioning

confidence: 98%

“…Several algorithms for achieving Approximate Agreement have been published. Many employ multiple rounds of message exchange and convergent voting algorithms which guarantee that the range of values held by the nonfaulty processes is reduced in each round [5], [6], [14], [25], [26]. This property, called single-step convergence, guarantees that the range of values will eventually be less than e, given enough rounds.…”

Section: Introduction N Important Issue In Fault-tolerant Distribumentioning

confidence: 99%

“…Second, in most studies of Approximate Agreement, all faults are modeled as worst-case Byzantine faults. However, in real world systems, the vast majority of faults tend not to be Byzantine in nature [17], [23], [26]. As a result, voting algorithm analysis tends to be overly conservative, leading to system designs which are unnecessarily complex.…”

Section: Introduction N Important Issue In Fault-tolerant Distribumentioning

confidence: 99%

See 3 more Smart Citations

Reaching approximate agreement with mixed-mode faults

Kieckhafer

Azadmanesh

1994

IEEE Trans. Parallel Distrib. Syst.

107

View full text Add to dashboard Cite

In a fault-tolerant distributed system, different nonfaulty processes may arrive at different values for a given system parameter. To resolve this disagreement, processes must exchange and vote upon their respective local values. Faulty processes may attempt to inhibit agreement by acting in a malicious or "Byzantine" manner. Approximate Agreement defines one form of agreement in which the voted values obtained by the nonfaulty processes need not be identical. Instead, they need only agree to within a predefined tolerance. Approximate Agreement can be achieved by a sequence of convergent voting rounds, in which the range of values held by nonfaulty processes is reduced in each round.Historically, each new convergent voting algorithm has been accompanied by &-hoc proofs of its convergence rate and faulttolerance, using an overly conservative fault model in which aU faults exhibit worst-case Byzantine behavior. This paper presents a general method to quickly determine convergence rate and fault-tolerance for any member of a broad family of convergent voting algorithms. This method is developed under a realistic mixed-mode fault model comprised of asymmetric, symmetric, and benign fault modes. These results are employed to more accurately analyze the properties of several existing voting algorithms, to derive a sub-family of optimal mixed-mode voting algorithms, and to quickly determine the properties of proposed new voting algorithms.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: A Three-mode Fault Modelmentioning

confidence: 98%

Section: Introduction N Important Issue In Fault-tolerant Distribumentioning

confidence: 99%

Section: Introduction N Important Issue In Fault-tolerant Distribumentioning

confidence: 99%

See 2 more Smart Citations

Reaching approximate agreement with mixed-mode faults

Kieckhafer

Azadmanesh

1994

IEEE Trans. Parallel Distrib. Syst.

107

View full text Add to dashboard Cite

show abstract

“…The vast majority of research in convergent voting has considered only completely connected systems [5,6,10,12,13]. Thus, any node can receive direct messages from all other nodes.…”

Section: Local and Global Convergencementioning

confidence: 99%

Global Convergence in Partially Fully Connected Networks (Pfcn) With Limited Relays

Azadmanesh

Krings

Ghahramani

2003

Int. J. Info. Tech. Dec. Mak.

View full text Add to dashboard Cite

In a distributed system, it is often necessary for nodes to agree on a particular event or to coordinate their activities. Applications of distributed agreement are many, such as Commit Protocols in distributed database systems, selection of a monitor node in a distributed system, detecting an intruder, or agreeing on the malicious behavior of a node. Among many forms of Distributed Agreement, one form is called Approximate Agreement (AA), in which the nodes, by exchanging their local values with other nodes, need to agree on values which are approximately equal to each other. Research on AA for fully connected networks is relatively mature. In contrast, the study of AA in partially connected networks has been very limited. More specifically, no general solution to the AA problem exists for such networks. This research solves the AA problem for a specific, scalable, partially connected network with limited relays. The research considers the worst failure mode of nodes, called Byzantine, and hybrid failure modes. The results show low communication cost in comparison to fully connected networks. The network is designed to take advantage of the results available for fully connected networks. Thus, the analysis for obtaining the expressions for Convergence Rate and Fault Tolerance becomes relatively easy.

show abstract

Fault-tolerant synchronization using phase-locked clocks

Krishna

1990

Microelectronics Reliability

View full text Add to dashboard Cite

Design of fault-tolerant clocks with realistic failure assumptions

Cited by 5 publications

References 6 publications

Reaching approximate agreement with mixed-mode faults

Reaching approximate agreement with mixed-mode faults

Global Convergence in Partially Fully Connected Networks (Pfcn) With Limited Relays

Fault-tolerant synchronization using phase-locked clocks

Contact Info

Product

Resources

About