Efficient search using adaptive metadata spreading in peer-to-peer networks

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Search is until now a difficult problem in peer-to-peer (P2P) filesharing systems. In this paper, we propose to use adaptive metadata spreading to make search in P2P networks efficient and scalable to large-scale systems. We model the search process in unstructured P2P networks obtain the optimized metadata populations for performance optimization. Based on the model, we propose adaptive metadata spreading approach which can adapt metadata populations to variational environment and achieve the optimized search performance. To implement our approach in fully decentralized P2P system, we employ self-organized fault-tolerant overlay trees, through which peers can easily cooperate with each other to perform adaptive metadata spreading with minor overhead. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Liu, X., Yang, G., Chen, M., & Wu, Y. (2004). Efficient search using adaptive metadata spreading in peer-to-peer networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3251, 551–558. https://doi.org/10.1007/978-3-540-30208-7_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free