2006/10/31 by Shi Xiao, Xiao, Shi, Gaoxi Xiao +1
Computer Science · #Caching and Content Delivery #Data Management and Algorithms #FOS: Computer and information sciences #Peer-to-Peer Network Technologies #Performance (cs.PF) #cs.PF
paper · pdf · doi:10.48550/arxiv.cs/0610173
6 pages, 3 figs, shortly published by ECCS'06
arxiv created 2006/10/31 · openalex publication_date 2006/10/31 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Decentralized search aims to find the target node in a large network by using only local information. The applications of it include peer-to-peer file sharing, web search and anything else that requires locating a specific target in a complex system. In this paper, we examine the degree-based decentralized search method. Specifically, we evaluate the efficiency of the method in different cases with different amounts of available local information. In addition, we propose a simple refinement algorithm for significantly shortening the length of the route that has been found. Some insights useful for the future developments of efficient decentralized search schemes have been achieved.