Article

Unstructured peer-to-peer networks: topological properties and search performance

Authors:

George H. L. Fletcher,

Hardik A. Sheth,

Katy BörnerAuthors Info & Claims

AP2PC'04: Proceedings of the Third international conference on Agents and Peer-to-Peer Computing

Pages 14 - 27

https://doi.org/10.1007/11574781_2

Published: 19 July 2004 Publication History

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.

References

[1]

ADAMIC, LADA, RAJAN LUKOSE, AMIT PUNIYANI, AND BERNARDO HUBERMAN. Search in Power-Law Networks. Physical Review E, 64(4):46135-46143, 2001.

[2]

AKAVIPAT, RUJ, LE-SHIN WU AND FILIPPO MENCZER. Small World Peer Networks in Distributed Web Search. Proc. ACM WWW2004, pp. 396-397, 2004.

Digital Library

[3]

ALBERT, RÉKA AND ALBERT-LÁSZLÓ BARABÁsi. Statistical Mechanics of Complex Networks. Reviews of Modern Physics, 74(1):47-97, 2002.

[4]

BABAOǦLU, Ö., H. MELING, AND A. MONTRESOR. Anthill: A Framework for the Development of Agent-Based Peer-to-Peer Systems. Proc. IEEE ICDCS'02, pp. 15- 22, 2002.

Digital Library

[5]

BANAEI-KASHANI, FARNOUSH AND CYRUS SHAHABI. Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems." Proc. IEEE/ACM CCGRID'03, pp. 351-358, 2003.

Digital Library

[6]

BATAGELJ, VLADIMIR AND ANDREJ MRVAR. Pajek: Package for Large Network Analysis. http://vlado.fmf.uni-lj.si/pub/networks/pajek/

[7]

BORGATTI, S.P., M.G. EVERETT, AND L.C. FREEMAN. Ucinet for Windows: Software for Social Network Analysis. Harvard: Analytic Technologies, 2002.

[8]

DECKER, K., K. SYCARA, AND M. WILLIAMSON. Middle-Agents for the Internet. Proc. IJCAI97, pp. 578-583, 1997.

[9]

DIMAKOPOULOS, VASSILIOS V. AND EVAGGELIA PITOURA. A Peer-to-Peer Approach to Resource Discovery in Multi-Agent Systems. Proc. CIA 2003, Springer LNCS 2782, pp. 62-77, 2003.

[10]

FALOUTSOS, M., P. FALOUTSOS, AND C. FALOUTSOS. On Power-Law Relationships of the Internet Topology. Proc. ACM SIGCOMM, pp. 251-262, 1999.

Digital Library

[11]

JOVANOVIC, M., F. ANNEXSTEIN, AND K. BERMAN. Modeling Peer-to-Peer Network Topologies Through "Small-World" Models and Power Laws. IX Telecommunications Forum TELFOR 2001.

[12]

KALOGERAKI, VANA, DIMITRIOS GUNOPULOS AND D. ZEINALIPOUR-YAZTI. A Local Search Mechanism for Peer-to-Peer Networks. Proc. ACM CIKM'02, pp. 300- 307, November 2002.

Digital Library

[13]

KLEINBERG, JON. Navigation in a Small World. Nature, 406:845, August 2000.

[14]

KOUBARAKIS, Manolis. Multi-Agent Systems and Peer-to-Peer Computing: Methods, Systems and Challenges. Proc. CIA 2003, Springer LNCS 2782, pp. 46-61, 2003.

[15]

LV, QIN ET AL. Search and Replication in Unstructured Peer-to-Peer Networks. Proc. ACM ICS'02, pp. 84-95, 2002.

Digital Library

[16]

MINAR, N., R. BURKHART, C. LANGTON, AND M. ASKENAZI. The Swarm Simulation System, A Toolkit for Building Multi-Agent Simulations. Technical Report, Swarm Development Group, June 1996.

[17]

MILOJIČIC, DEJAN S., ET AL. Peer-to-Peer Computing. HP Labs Technical Report HPL-2002-57, 2002.

[18]

NEWMAN, M.E.J. The Structure and Function of Complex Networks. SIAM Review, 45(2):167-256, 2003.

Digital Library

[19]

PANDURANGAN, G., PRABHAKAR RAGHAVAN, AND ELI UPFAL. Building Low-Diameter Peer-to-Peer Networks. IEEE J. Select. Areas Commun., 21(6):995-1002, August 2003.

Digital Library

[20]

RATNASAMY, SYLVIA ET Al. A Scalable Content-Addressable Network. Proc. ACM SIGCOMM, pp. 161-172, August 2001.

Digital Library

[21]

SAFFRE, FABRICE AND ROBERT GHANEA-HERCOCK. Beyond Anarchy: Self Organized Topology for Peer-to-Peer Networks. Complexity, 9(2):49-53, 2003.

Digital Library

[22]

SARSHAR, NIMA, P. OSCAR BOYKIN, AND VWANI ROYCHOWDHURY. Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable. Proc. IEEE P2P2004, pp. 2-9, 2004.

Digital Library

[23]

SHEHORY, O. A Scalable Agent Location Mechanism. Proc. ATAL'99 Intelligent Agents VI, pp. 162-172, 1999.

Digital Library

[24]

STOICA, ION ET AL. Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE/ACM Trans. on Networking, 11(1): 17-32, February 2003.

Digital Library

[25]

TSOUMAKOS, DIMITRIOS AND NICK ROUSSOPOULOS. A Comparison of Peer-to-Peer Search Methods. Proc. ACM WebDB 2003, pp. 61-66, 2003.

[26]

TSOUMAKOS, DIMITRIOS AND NICK ROUSSOPOULOS. Adaptive Probabilistic Search for Peer-to-Peer Networks. Proc. IEEE P2P2003, pp. 102-109, 2003.

Digital Library

[27]

WALSH, TOBY. Search in a Small World. Proc. IJCAI99, pp. 1172-1177, July-August 1999.

Digital Library

[28]

WATTS, DUNCAN AND STEVEN STROGATZ. Collective Dynamics of 'Small-World' Networks. Nature, 393:440-442, June 1998.

[29]

YANG, BEVERLY AND HECTOR GARCIA-MOLINA. Improving Search in Peer-to-Peer Networks. Proc. IEEE ICDCS'02, pp. 5-14, 2002.

Digital Library

Cited By

Viji Rajendran VSwamynathan S(2019)SD-CSRJournal of Network and Systems Management10.1007/s10922-018-9479-727:3(625-646)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1007/s10922-018-9479-7
D'Angelo GFerretti SMarzolla MLiu JQuaglia FEidenbenz SGilmore S(2011)Adaptive event dissemination for peer-to-peer multiplayer online gamesProceedings of the 4th International ICST Conference on Simulation Tools and Techniques10.5555/2151054.2151110(312-319)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.5555/2151054.2151110
Lopes ABotelho L(2008)Efficient algorithms for agent-based semantic resource discoveryProceedings of the 7th international conference on Agents and Peer-to-Peer Computing10.1007/978-3-642-31809-2_7(71-82)Online publication date: 13-May-2008
https://dl.acm.org/doi/10.1007/978-3-642-31809-2_7
Show More Cited By

Recommendations

On Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks

Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce ...
Generalized Probabilistic Flooding in Unstructured Peer-to-Peer Networks

In this paper, we propose a generalization of the basic flooding search strategy for decentralized unstructured peer-to-peer (P2P) networks. In our algorithm a peer forwards a query to one of its neighbors using a probability that is a function of the ...
A novel approach to improving search efficiency in unstructured peer-to-peer networks

The decentralized peer-to-peer (P2P) technique has been widely used to implement scalable file sharing systems. It organizes nodes in a system into a structured or unstructured network. The advantages of the unstructured P2P systems are that they have ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

AP2PC'04: Proceedings of the Third international conference on Agents and Peer-to-Peer Computing

July 2004

245 pages

ISBN:3540297553

Editors:
Gianluca Moro
Dept. of Electronics, Computer Science and Systems, University of Bologna, Via Venezia, 52, Cesena (FC), Italy
,
Sonia Bergamaschi
Dept. of Science Engineering, University of Modena and Reggio-Emilia, via Vignolese, 905, Modena, Italy
,
Karl Aberer
School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne (EPFL), via Vignolese, 905, Lausanne, Switzerland

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 19 July 2004

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Viji Rajendran VSwamynathan S(2019)SD-CSRJournal of Network and Systems Management10.1007/s10922-018-9479-727:3(625-646)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1007/s10922-018-9479-7
D'Angelo GFerretti SMarzolla MLiu JQuaglia FEidenbenz SGilmore S(2011)Adaptive event dissemination for peer-to-peer multiplayer online gamesProceedings of the 4th International ICST Conference on Simulation Tools and Techniques10.5555/2151054.2151110(312-319)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.5555/2151054.2151110
Lopes ABotelho L(2008)Efficient algorithms for agent-based semantic resource discoveryProceedings of the 7th international conference on Agents and Peer-to-Peer Computing10.1007/978-3-642-31809-2_7(71-82)Online publication date: 13-May-2008
https://dl.acm.org/doi/10.1007/978-3-642-31809-2_7
Rodero-Merino LLópez LFernández ACholvi V(2006)A topology self-adaptation mechanism for efficient resource locationProceedings of the 4th international conference on Parallel and Distributed Processing and Applications10.1007/11946441_61(660-671)Online publication date: 4-Dec-2006
https://dl.acm.org/doi/10.1007/11946441_61

View Options

View options

Figures

Tables

Media

View Table of Conten