Search in Complex Networks : a New Method of Naming

TL;DR

This paper introduces a novel node naming method for scale-free networks that enables efficient routing with minimal memory, achieving near-shortest path routing even when full network information is unavailable.

Contribution

The paper proposes a new node labeling technique tailored for scale-free networks that significantly reduces memory needs while maintaining high-quality routing performance.

Findings

Routing success probability is high with the new naming scheme.

Memory requirements at routers are substantially decreased.

Paths are close to the shortest possible.

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.