Search in Complex Networks : a New Method of Naming

Abstract

We suggest a method for routing when the source does not posses full information about the shortest path to the destination. The method is particularly useful for scale-free networks, and exploits its unique characteristics. By assigning new (short) names to nodes (aka labelling) we are able to reduce significantly the memory requirement at the routers, yet we succeed in routing with high probability through paths very close in distance to the shortest ones.

5 pages, 4 figures

References in corpus (2)

• Searchability of Networks
• Information Horizons in Networks

Cited by in corpus (7)

• Critical phenomena in complex networks
• On Compact Routing for the Internet
• Nature-Inspired Interconnects for Self-Assembled Large-Scale Network-on-Chip Designs
• Congestion diffusion and decongestion strategy in networked traffic
• Partition of Networks into Basins of Attraction
• A novel approach to study realistic navigations on networks
• Realistic searches on stretched exponential networks