The EBA Protocol EGAP Sample Clauses

The EBA Protocol EGAP. EGAP can tolerate up to Þm malicious faulty processors, Þd dormant faulty processors, Cm malicious faulty communication media and Cd dormant faulty communication media, where n > 3Þm+Þd and c > 2(Þm+Cm)+Þd +Cd. The definition of protocol EGAP is shown in Figure 4. There are three phases in protocol EGAP, which are the message exchange phase, the early stopping diagnosis phase and the decision making phase. In EBA protocols, the number of actual faulty components in the network decides the actual number of rounds of message exchange needed. In ▇▇▇▇▇▇ and ▇▇▇▇▇’▇ protocol [13] , for example, they assume that the fallible components are processors only and that the failure type with the fallible processor is malicious only. Hence, they come to the conclusion that the actual number of rounds of message exchange is min{fm+2, t+1}, where t = ⎣(n-1)/3⎦ in a reliable fully connected network without faulty communication media. In the generalized failure mode, the fallible components can be either processors or communication media or both, and the failure type assumption is dual failure mode. Because RFC is capable of providing the so-called virtual channel to make an un-fully connected network act just like a fully connected network and avoiding the influence from both dormant and malicious faulty communication media in each round of message exchange, that means RFC is free from the influence of faulty communication media. Therefore, in our proposed protocol EGAP no additional round of message exchange is needed. That is, the faulty communication media would not affect the number of rounds of message exchange. And the dormant faulty processor can be detected by RFC, if the Manchester code [12] is used in encoding before transmission. Therefore, we can reduce the maximum number of rounds of message exchange from t+1 to t*+1, where t* = ⎣(n-1-fd)/3⎦. Consequently, the actual number of rounds of message exchange with EGAP is min{fm+2, t*+1}. In the message exchange phase of EGAP, RFC is used to send messages, and the actual number of rounds of EGAP operations is min{fm+2, t*+1}. At end of each round r, each processor stores the received messages without vertices with duplicated names from RFC to the corresponding vertices at level r of its ic-tree, (the detailed description of the ic-tree is presented in Appendix B), which is a tree structure to store the messages received, where 1≦r≦min{fm+2, t*+1}. In the early stopping diagnosis phase of EGAP, we use the concept of...