On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Scalable Agent Location Mechanism
ATAL '99 6th International Workshop on Intelligent Agents VI, Agent Theories, Architectures, and Languages (ATAL),
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Anthill: A Framework for the Development of Agent-Based Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Statistical mechanics of complex networks
Statistical mechanics of complex networks
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Beyond anarchy: self-organized topology for peer to peer networks
Complexity - Special issue: Resilient and adaptive defense of computing networks
Small world peer networks in distributed web search
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Building low-diameter peer-to-peer networks
IEEE Journal on Selected Areas in Communications
Counteracting free riding in Peer-to-Peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-managed topologies in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive event dissemination for peer-to-peer multiplayer online games
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
A topology self-adaptation mechanism for efficient resource location
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Efficient algorithms for agent-based semantic resource discovery
AP2PC'08 Proceedings of the 7th international conference on Agents and Peer-to-Peer Computing
Hi-index | 0.00 |
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust self-organizing P2P topologies that support efficient search. In this paper we discuss four structured and unstructured P2P models (CAN, Chord, PRU, and Hypergrid) and three characteristic search algorithms (BFS, k-Random Walk, and GAPS) for unstructured networks. We report on the results of simulations of these networks and provide measurements of search performance, focusing on search in unstructured networks. We find that the proposed models produce small-world networks, and yet none exhibit power-law degree distributions. Our simulations also suggest that random graphs support decentralized search more effectively than the proposed unstructured P2P models. We also find that on these topologies, the basic breadth-first search algorithm and its simple variants have the lowest search cost.