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 article 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 lin...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on fuzzy systems Ročník 30; číslo 7; s. 2241 - 2253
Hlavní autoři: Yang, Xiao-Peng, Zheng, Gengzhong
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.07.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Addition-min composition
Algorithms
Bandwidth
Data communication
Fault tolerance
Faults
fuzzy relation inequality
Indexes
Inequalities
Linear programming
Optimization
Peer to peer computing
peer-to-peer (P2P) network system
Programming
reordered-vector-based (RVB) algorithm
Social networks
tolerant line faults
ISSN:1063-6706, 1941-0034
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The addition-min fuzzy relation inequalities could be applied to characterize the peer-to-peer (P2P) network system. This article 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. Furthermore, the so-called reordered-vector-based (RVB) algorithms I and II are proposed for searching the maximum number of arbitrary and specific line faults in a given P2P network system, respectively. The validness of our proposed RVB algorithms is verified by formally proving and some numerical examples.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1063-6706
1941-0034
DOI:10.1109/TFUZZ.2021.3078529