Consensus under unreliable transmission

Reaching fault diagnosis agreement on an unreliable general network

“…• A processor does not know the fault status of the links in the general network, however, dormant faulty links can be detected [9,14].…”

“…The constraint of the inequality c > 2L a þ L d is necessary, because a fault-free processor can detect dormant faults when the protocol appropriately encodes a transmitted message using either the Non-Return-to-Zero code or the Manchester code [9,14] before transmission. In the worst situation, the receiver processor is able to obtain c À L d copies of the value from the sender processor.…”

“…When designing a fault-tolerance distributed system, Byzantine agreement (BA) [2,[4][5][6][7][10][11][12][13][14] regulation is one of the major considerations. Under many circumstances, a fault-free processor in a distributed system is able to reach an agreement before performing unique tasks [1][2][3].…”

“…The faults on the links can be classified into three categories according to their symptoms: crash faults, stuck-at faults and arbitrary faults (also called Byzantine faults) [14]. A crash fault appears when a link is broken.…”

“…Unlike faulty links, the fault-free link is able to transmit messages on time and correctly. Moreover, it is able to easily detect crash and omission faults when the protocol has appropriately encoded the transmitted message using either the Non-Return-to-Zero code or the Manchester code [9,14] before transmission. Thus, these faults are called dormant faults.…”