Maximum Number of Line Faults in a P2P Network System Based on the Addition-Min Fuzzy Relation Inequalities

The addition-min fuzzy relation inequalities could be applied to characterize the Peer-to-Peer (P2P) network system. This paper focuses on the problem that how many arbitrary (or specific) line faults a P2P network system is able to bear at most. In order to find the maximum number of tolerant line faults, we first study the consistency checking of the P2P network system with a given number of arbitrary line faults. Corresponding properties and illustrative example are also presented. Based on the consistency checking, we further propose the so-called Reordered-Vector-Based (RVB) algorithm for searching the maximum number of tolerant line faults in a given P2P network system. The validness of our proposed RVB algorithm is verified by formally proving and numerical example.