Volume 74, Number 6, June 2006
|Page(s)||1102 - 1108|
|Section||Interdisciplinary physics and related areas of science and technology|
|Published online||17 May 2006|
Searching complex networks efficiently with minimal information
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
Accepted: 13 April 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.
PACS: 89.20.Ff – Computer science and technology / 89.75.Fb – Structures and organization in complex systems / 02.50.Cw – Probability theory
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.