Locating Malicious Links in Fully-Connected Networks Using a Formal Framework

Abstract

Byzantine agreement problem has been mostly studied for networks with fallible processors. However, link failure is a common problem in distributed system when the messages are relayed through individual processors and delivered to the receiver. There are few works on locating malicious faulty links using byzantine framework. The proposed protocol can detect/locate maximum number of malicious faulty links and tolerate maximum number of allowable faulty links to make each fault-free processor reaching a common agreement.