Fletcher, George H. L. and Sheth, H.A. and Borner, K. (2004) Unstructured peer-to-peer networks: topological properties and search performance. In: Moro, G. and Bergamaschi, S. and Aberer, K. (eds.) Agents and Peer-to-Peer Computing, Third International Workshop: AP2PC 2004. Lecture Notes in Computer Science 3601. Springer, pp. 14-27. ISBN 9783540297550.
Abstract
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 30 Mar 2021 08:33 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43735 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
