Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
NodeWiz: peer-to-peer resource discovery for grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
Resilience of structured P2P systems under churn: The reachable component method
Computer Communications
Communities on the road: fast triggering of interactive multimedia services
Multimedia Tools and Applications
Approximating betweenness centrality
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
DRing: A Layered Scheme for Range Queries over DHTs
CIT '11 Proceedings of the 2011 IEEE 11th International Conference on Computer and Information Technology
Publish-subscribe systems via gossip: a study based on complex networks
Proceedings of the Fourth Annual Workshop on Simplifying Complex Networks for Practitioners
Inducing Scale-Free Characteristics of Dynamic Unstructured P2P Networks
AINA '12 Proceedings of the 2012 IEEE 26th International Conference on Advanced Information Networking and Applications
| Hi-index | 0.00 |
This paper presents a self-organizing protocol for dynamic (unstructured P2P) overlay networks, which allows to react to the variability of node arrivals and departures. Through local interactions, the protocol avoids that the departure of nodes causes a partitioning of the overlay. We show that it is sufficient to have knowledge about 1st and 2nd neighbours, plus a simple interaction P2P protocol, to make unstructured networks resilient to node faults. A simulation assessment over different kinds of overlay networks demonstrates the viability of the proposal.