Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Defending against eclipse attacks on overlay networks
Proceedings of the 11th workshop on ACM SIGOPS European workshop
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Machine learning for efficient neighbor selection in unstructured P2P networks
SYSML'07 Proceedings of the 2nd USENIX workshop on Tackling computer systems problems with machine learning techniques
On static and dynamic partitioning behavior of large-scale P2P networks
IEEE/ACM Transactions on Networking (TON)
Node isolation model and age-based neighbor selection in unstructured P2P networks
IEEE/ACM Transactions on Networking (TON)
Peer-exchange schemes to handle mismatch in peer-to-peer systems
The Journal of Supercomputing
A locality aware cache diffusion system
The Journal of Supercomputing
Exploiting the heterogeneity in structured peer-to-peer systems
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Hi-index | 0.00 |
Recent work has shown that intelligent neighbor selection during construction can significantly enhance the performance of peer-to-peer overlay networks. While its impact on performance has been recognized, few have examined the impact of neighbor selection on network resilience. In this paper, we study the impact with a generalized cost model for overlay construction that takes into consideration different types of heterogeneity, such as node capacity and network proximity. Our simulation results show that the resulting performance improvement comes at the cost of static resilience against targeted attacks and adding random redundancy can improve the resilience significantly.