2004/08/11 by Gábor Csárdi, Gabor Csardi, Maxwell Young +8
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Disordered Systems and Neural Networks (cond-mat.dis-nn) #Distributed systems and fault tolerance #FOS: Physical sciences #Peer-to-Peer Network Technologies #cond-mat.dis-nn
paper · pdf · doi:10.48550/arxiv.cond-mat/0408248
Report for a student project at the Complex Systems Summer School organized by the Santa Fe Institute, 2004
arxiv created 2004/08/11 · openalex publication_date 2004/08/11 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we study the resilience of peer-to-peer networks to preferential attacks. We define a network model and experiment with three di erent simple repairing algorithms, out of which the so called 2nd neighbor rewiring algorithm is found to be e ective and plausible for keeping a large connected component in the network, in spite of the continuous attacks. While our motivation comes from peer-to-peer file sharing networks, we believe that our results are more general and applicable in a wide range of networks. All this work was done as a student project in the Complex Systems Summer School 2004, organized by the Santa Fe Institute in Santa Fe, NM, USA.