Abstract | ||
---|---|---|
We study the tolerance of complex networks to attacks. Due to the large network scale, it is almost impossible for an attacker to have the complete topology information about the whole network. Thus, an efficient attack strategy based on partial degree information is proposed. Using the generating function method we give the exact solution for the attack strategy. A theoretical scale-free random network and the real Internet data are considered as examples, and the results clearly show the performance degradation due to the lack of topology information. By comparing to previous strategies, the efficiency of our strategy is demonstrated. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/ISCAS.2011.5937881 | ISCAS |
Keywords | Field | DocType |
partial degree information,efficient attack strategy,internet,communication networks,generating function method,topology information,security of data,robustness,complex network,complex networks,topology,exact solution,internet topology,scale free,generating function | Internet topology,Generating function,Telecommunications network,Random graph,Topology information,Computer science,Computer network,Robustness (computer science),Complex network,Distributed computing,The Internet | Conference |
ISSN | ISBN | Citations |
0271-4302 E-ISBN : 978-1-4244-9472-9 | 978-1-4244-9472-9 | 1 |
PageRank | References | Authors |
0.37 | 5 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yongxiang Xia | 1 | 78 | 9.76 |
Jin Fan | 2 | 1 | 0.37 |