Name
Abstract | ||
|---|---|---|
In this paper, we study the vulnerability of networks in the case of random removal of individual nodes. To achieve this goal, a network reliability measure, the probability of messages facing malfunctions, has been proposed. The benefit of this measure is its capability of applying in a wide range of graphs. Moreover, it is well suited to human activities and foraging patterns of some sorts of animals, as they try to make an alternative path in the case of facing failures. We examine the most prominent communication networks such as meshes and tori; further, CAN, Chord, Petersen, PRU, and Hypergrid, which are well suited for P2P networks, have been investigated. In order to gain a better understanding of the studied networks’ vulnerability and easier evaluation of the proposed measure, an ant colony-based communication protocol has been presented. Experimental results verify the correctness of the proposed measure. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1080/00207160.2015.1045296 | Int. J. Comput. Math. |
Keywords | Field | DocType |
fault-tolerance, network theory, network vulnerability, interconnection networks, P2P networks, performance evaluation, ant colony | Telecommunications network,Correctness,Fault tolerance,Network theory,Reliability (computer networking),Chord (music),Mathematics,Communications protocol,Vulnerability,Distributed computing | Journal |
Volume | Issue | ISSN |
93 | 7 | 0020-7160 |
Citations | PageRank | References |
0 | 0.34 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Farshad Safaei | 1 | 95 | 19.37 |
| Hamidreza Sotoodeh | 2 | 1 | 1.36 |