Improving network robustness

被引:10
作者
Beygelzimer, A [1 ]
Grinstein, G [1 ]
Linsker, R [1 ]
Rish, I [1 ]
机构
[1] IBM Corp, TJ Watson Res Ctr, Yorktown Hts, NY 10598 USA
来源
INTERNATIONAL CONFERENCE ON AUTONOMIC COMPUTING, PROCEEDINGS | 2004年
关键词
D O I
10.1109/ICAC.2004.1301397
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a simple, fully decentralized approach to improving robustness of existing unstructured overlay networks against a selective deletion of nodes (e.g., attacks on network hubs). The approach is based on modifying the network by adding or rewiring links at random. We quantify the effectiveness of adding randomness to the network by computing the curve governing the tradeoff between the number of modifications and the increase in robustness. For certain networks, a relatively modest amount of randomization can significantly improve the average path length (quantifying performance degradation) and the size of the largest connected component (quantifying network availability) after an attack.
引用
收藏
页码:322 / 323
页数:2
相关论文
共 8 条
[1]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[2]  
[Anonymous], 2004, INFOCOM
[3]   Highly optimized tolerance: A mechanism for power laws in designed systems [J].
Carlson, JM ;
Doyle, J .
PHYSICAL REVIEW E, 1999, 60 (02) :1412-1427
[4]  
ERDOS P, 1960, B INT STATIST INST, V38, P343
[5]  
Law C, 2003, IEEE INFOCOM SER, P2133
[6]   The structure and function of complex networks [J].
Newman, MEJ .
SIAM REVIEW, 2003, 45 (02) :167-256
[7]   Optimization of robustness and connectivity in complex networks [J].
Shargel, B ;
Sayama, H ;
Epstein, IR ;
Bar-Yam, Y .
PHYSICAL REVIEW LETTERS, 2003, 90 (06) :4
[8]  
Winick Jared., 2002, Inet-3.0: Internet topology generator