An effective local routing strategy on the BA network

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 va...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2008-04
Main Authors: Yu-Jian, Li, Zhen-Dong Xi, Chuan-Yang, Yin, Bing-Hong, Wang
Format: Article
Language:English
Subjects:
Communication networks
Order parameters
Strategy
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.0804.4090