On Degree-Based Decentralized Search in Complex Networks

Details On Degree-Based Decentralized Search in Complex Networks On Degree-Based Decentralized Search in Complex Networks

2006-10-31

arxiv.org/abs/cs/0610173v1

Computer Science

Performance

6 pages, 3 figs, shortly published by ECCS'06

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Degree-Based Decentralized Search in Complex Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Degree-Based Decentralized Search in Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Degree-Based Decentralized Search in Complex Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-47035