An effective local routing strategy on the BA network

TL;DR

This paper introduces a new local routing strategy for BA networks that significantly improves network capacity by tuning a preferential delivery parameter, based on nearest neighbor search with capacity considerations.

Contribution

It proposes a novel routing strategy incorporating a preferential exponent, enhancing capacity and efficiency over traditional nearest-neighbor methods in scale-free networks.

Findings

Network capacity is significantly improved by tuning alpha.

Capacity depends on parameters m and K.

The strategy is cost-effective and practical for communication networks.

Abstract

In this paper, We propose a effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential delivering exponent alpha. we assume that the handling capacity of one vertex is proportional to its degree when the degree is smaller than a cut-off value $K$, and is infinite otherwise. It is found that by tuning the parameter alpha, the scale-free network capacity measured by the order parameter is considerably enhanced compared to the normal nearest-neighbor strategy. Traffic dynamics both near and far away from the critical generating rate R_c are discussed. We also investigate R_c as functions of m (connectivity density), K (cutoff value). Due to the low cost of acquiring nearest-neighbor information and the strongly improved network capacity, our strategy may be useful and reasonable for the protocol designing of modern communication networks.