Searching complex networks efficiently with minimal information

作     者：Carmi, S. Cohen, R. Dolev, D. 

作者机构：Bar Ilan Univ Minerva Ctr Ramat Gan Israel Bar Ilan Univ Dept Phys Ramat Gan Israel Boston Univ Dept Elect & Comp Engn Boston MA 02215 USA Hebrew Univ Jerusalem Sch Engn & Comp Sci Jerusalem Israel 

出 版 物：《EUROPHYSICS LETTERS》 (欧洲物理学快报)

年 卷 期：2006年第74卷第6期

页      面：1102-1108页

核心收录：

学科分类：07[理学] 0702[理学-物理学] 

主　　题：INTERNET 

摘      要：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.