On Degree-Based Decentralized Search in Complex Networks

Simple item page
dc.creatorXiao, Shi
dc.creatorXiao, Gaoxi
dc.date2006-10-31
dc.date.accessioned2026-07-07T07:27:57Z
dc.date.available2026-07-07T07:27:57Z
dc.descriptionDecentralized 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.
dc.description6 pages, 3 figs, shortly published by ECCS'06
dc.identifierhttps://arxiv.org/abs/cs/0610173
dc.identifierhttp://arxiv.org/abs/cs/0610173
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117557
dc.subjectPerformance
dc.titleOn Degree-Based Decentralized Search in Complex Networks
dc.typetext

Files

Collections

arXiv