Searching complex networks efficiently with minimal informationS. Carmi1, R. Cohen2 and D. Dolev3
1 Minerva Center and Department of Physics, Bar-Ilan University - Ramat-Gan, Israel
2 Electrical and Computer Engineering Department, Boston University Boston, MA, USA
3 School of Engineering and Computer Science, Hebrew University - Jerusalem, Israel
received 3 March 2006; accepted in final form 13 April 2006
published online 17 May 2006
The ability to perform an efficient search in a complex network is of great importance in real-world systems. We suggest a method for searching for nodes when the source does not possess full information about the shortest path to the destination. By assigning new short names to nodes we are able to reduce significantly the amount of information stored at the nodes, such that the required memory needed scales only logarithmically with the network size; yet we succeed in finding the destination node through paths very close in distance to the shortest ones. The method is shown to perform particularly well on scale-free networks, exploiting its unique characteristics. This, together with other properties, makes our method extremely useful for realistic systems such as the Internet.
89.20.Ff - Computer science and technology.
89.75.Fb - Structures and organization in complex systems.
02.50.Cw - Probability theory.
© EDP Sciences 2006