A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
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
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Can Heterogeneity Make Gnutella Scalable?
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
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Autonomous Topology Optimization for Unstructured Peer-to-Peer Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
| Hi-index | 0.00 |
The topology of a Peer-To-Peer (P2P) overlay network is usually constructed randomly without considering the characteristics of underlying physical links. Thus, searching and routing between peer nodes is often inefficient. This paper proposes a mechanism that a peer node autonomously optimises the topology of a P2P network based on the metrics of underlying networks. The simulation results show that this mechanism optimises the topology of a P2P network and significantly decreases the average hop count between any pair of peer nodes.