DocumentCode
3019856
Title
Improving network robustness
Author
Beygelmizer, A. ; Grinstein, Geoffrey ; Linsker, Ralph ; Rish, Irina
Author_Institution
IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA
fYear
2004
fDate
17-18 May 2004
Firstpage
322
Lastpage
323
Abstract
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.
Keywords
computer network reliability; random processes; telecommunication links; average path length; network availability; network robustness; performance degradation; selective node deletion; unstructured overlay networks; Availability; Computer networks; Control systems; Degradation; Network topology; Peer to peer computing; Probability distribution; Protocols; Robustness; Statistical distributions;
fLanguage
English
Publisher
ieee
Conference_Titel
Autonomic Computing, 2004. Proceedings. International Conference on
Print_ISBN
0-7695-2114-2
Type
conf
DOI
10.1109/ICAC.2004.1301397
Filename
1301397
Link To Document