In a series of recent papers, we showed how to avoid the
impossibility result of deterministic consensus in presence
of link failures [Gray,1978] for well-known Oral and Written Messages
Byzantine agreement algorithms. This is done by employing the
perception-based fault model [Schmid,2001]. We will, however, use a
simplified version of that model in this paper.
The Byzantine Agreement protocol presented in this paper is a
polynomial time protocol with optimal resilience in respect to the
simplified perception-based fault model. The most important feature of
the Byzantine Agreement algorithm is that it uses some of the
processes to tolerate process failures as well as to overcome link
failures, as we need only n > 2f+max{f,lra+lr+lsa+ls}, where lr,
lra, ls and lsa are measures of the link failures allowed.