A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An investigation of geographic mapping techniques for internet hosts
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Topology modeling via cluster graphs
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
IEEE Internet Computing
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A routing underlay for overlay networks
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
A Distributed Approach to Solving Overlay Mismatching Problem
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Dynamic Layer Management in Superpeer Architectures
IEEE Transactions on Parallel and Distributed Systems
Approaching Optimal Peer-to-Peer Overlays
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Optimizing overlay topology by reducing cut vertices
Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video
Practical locality-awareness for large scale information sharing
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem
INFORMS Journal on Computing
Hi-index | 0.00 |
Recently, peer-to-peer (P2P) model becomes popular due to its outstanding resource sharing ability in large-scale distributed systems. However, the most popular P2P system – unstructured P2P system, suffers greatly from the mismatching between the logical overlay and physical topology. This mismatching problem causes a large volume of redundant traffic, which makes peer-to-peer system far from scalable and degrades their search efficiency dramatically. In this paper we address the mismatching problem in an unstructured P2P architecture by developing a distributed overlay optimizing algorithm – HAND (Hops Adaptive Neighbor Discovery). Through comprehensive simulations, we show that HAND significantly outperforms previous approaches, especially in large-scale P2P systems.