|
|
Enhancement of scale-free network attack tolerance |
Qu Ze-Hui(瞿泽辉)a)b)†, Wang Pu(王璞) d), Song Chao-Ming(宋朝鸣)b)c), and Qin Zhi-Guang(秦志光)a) |
a School of Computer Science and Engineering, University of Electric Science & Technology of China, Chengdu 610054, China; b Center for Complex Network Research (CCNR), Department of Physics, Biology and Computer Science, Northeastern University, Boston, MA 02115, USA; c Center for Cancer Systems Biology, Dana Farber Cancer Institute, Harvard University, Boston, Massachusetts 02115, USA; d Department of Civil and Environmental Engineering, Massachusetts Institute of Technology Cambridge, MA 02139, USA |
|
|
Abstract Despite the large size of most communication and transportation systems, there are short paths between nodes in these networks which guarantee the efficient information, data and passenger delivery; furthermore these networks have a surprising tolerance under random errors thanks to their inherent scale-free topology. However, their scale-free topology also makes them fragile under intentional attacks, leaving us a challenge on how to improve the network robustness against intentional attacks without losing their strong tolerance under random errors and high message and passenger delivering capacity. Here we propose two methods (SL method and SH method) to enhance scale-free network's tolerance under attack in different conditions.
|
Received: 06 July 2010
Revised: 12 July 2010
Accepted manuscript online:
|
PACS:
|
89.20.Hh
|
(World Wide Web, Internet)
|
|
89.75.Hc
|
(Networks and genealogical trees)
|
|
Fund: Project supported in part by the China Scholarships Council (Grant No. 2007103794), the Defence Threat Reduction Agency Award HDTRA1-08-1-0027, the James S. McDonnell Foundation 21st Century Initiative in Studying Complex Systems, the National Science Foundation within the DDDAS (CNS-0540348), ITR (DMR-0426737) and IIS-0513650 programs, the US Office of Naval Research Award N00014-07-C, the National Natural Science Foundation of China (Grant Nos. 80678605 and 60903157), and the National High Technology Research and Development Program of China (Grant No. 2009AA01Z422). |
Cite this article:
Qu Ze-Hui(瞿泽辉), Wang Pu(王璞), Song Chao-Ming(宋朝鸣), and Qin Zhi-Guang(秦志光) Enhancement of scale-free network attack tolerance 2010 Chin. Phys. B 19 110504
|
[1] |
Onnela J P, Saramaki J, Hyvonen J, Szabo G, Lazer D, Kaski D, Kertesz J and Barabási A L 2007 Proceedings of the National Academy of Sciences 104 7332
|
[2] |
Wang P, Gonzalez M C, Hidalgo C A and Barabási A L 2009 Science 324 1071
|
[3] |
Hu H, Myers S, Colizza V and Vespignani A 2009 Proceedings of the National Academy of Sciences 106 1318
|
[4] |
Yook S H, Jeong H and Barabási A 2002 Proceedings of the National Academy of Sciences 99 13382
|
[5] |
Park J and Newman M E J 2003 Phys. Rev. E 68 026112
|
[6] |
Pastor-Satorras R, Vázquez A and Vespignani A 2001 Phys. Rev. Lett. 87 258701
|
[7] |
Albert R, Jeong H and Barabási A L 1999 Nature 401 130
|
[8] |
Colizza V, Barrat A, Barth'elemy M and Vespignani A 2006 Proceedings of the National Academy of Sciences 103 2015
|
[9] |
Li C J and Chen G R 2006 Modelling of Weighted Evolving Networks with Community Structures 370 869
|
[10] |
Lewis F L Wireless Sensor Networks. Smart Environments: Technologies, Protocols, and Applications (New York: Wiley Interscience)
|
[11] |
Wu X J and Lu H T 2010 Chin. Phys. B 19 070511
|
[12] |
Duncan W, Strogatz J and Steven H 1998 Nature 393 440
|
[13] |
Albert R and Barabási A L 2002 Rev. Mod. Phys. 74 47
|
[14] |
Barabási A L and Albert R 1999 Science 286 509
|
[15] |
Wang X H, Jiao L C and Wu J S 2001 Chin. Phys. B 19 020501
|
[16] |
Pu C L and Pei W J 2010 Acta Phys. Sin. 59 3841 (in Chinese)
|
[17] |
Callaway D S, Newman M E J, Strogatz S H and Watts D H 2000 Phys. Rev. Lett. 85 5468
|
[18] |
Palla G, Barabási A L and Vicsek T 2007 Nature 446 664
|
[19] |
Guo J L and Wang L N 2007 Acta Phys. Sin. 56 5635 (in Chinese)
|
[20] |
Krapivsky P L and Redner S 2001 Phys. Rev. E 63 066123
|
[21] |
Li T, Pei W J and Wang S P 2009 Acta Phys. Sin. 58 5903 (in Chinese)
|
[22] |
Li C J and Maini P K 2005 J. Phys. A 38 9741
|
[23] |
Feng C F, Guan J Y, Wu Z X and Wang Y H 2010 Chin. Phys. B 19 060203
|
[24] |
Albert R, Jeong H and Barabási A L 2000 Nature 406 482 endfootnotesize
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|