Efficiency of navigation in indexed networks

Details Efficiency of navigation in indexed networks Efficiency of navigation in indexed networks

2007-07-07

arxiv.org/abs/0707.1100v1

Dynamics on and of networks. N. Ganguly, A. Mukherjee and A. Deutsch, eds., (Birkauser, Boston, 2009), pp. 189-198.

Physics

Computational Physics

Scientific paper

10.1007/978-0-8176-4751-3_11

We investigate efficient methods for packets to navigate in complex networks. The packets are assumed to have memory, but no previous knowledge of the graph. We assume the graph to be indexed, i.e. every vertex is associated with a number (accessible to the packets) between one and the size of the graph. We test different schemes to assign indices and utilize them in packet navigation. Four different network models with very different topological characteristics are used for testing the schemes. We find that one scheme outperform the others, and has an efficiency close to the theoretical optimum. We discuss the use of indexed-graph navigation in peer-to-peer networking and other distributed information systems.

Affiliated with

Also associated with

No associations

Rating

Efficiency of navigation in indexed 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 Efficiency of navigation in indexed networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiency of navigation in indexed networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-702366