Traffic dynamics based on an efficient routing strategy on scale free networks

In this paper, we propose a new routing strategy on the basis of the so-called next-nearest-neighbor search strategy by introducing a preferential delivering exponent α. It is found that by tuning the parameter α, the scale-free network capacity measured by the order parameter is considerably enhanc...

Full description

Saved in:
Bibliographic Details
Published in:The European physical journal. B, Condensed matter physics Condensed matter physics, 2006, Vol.49 (2), p.205-211
Main Authors: YIN, C.-Y, WANG, B.-H, WANG, W.-X, YAN, G, YANG, H.-J
Format: Article
Language:English
Subjects:
Applied sciences
Communication networks
Exact sciences and technology
Information, signal and communications theory
Mathematical methods
Order parameters
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
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 new routing strategy on the basis of the so-called next-nearest-neighbor search strategy by introducing a preferential delivering exponent α. It is found that by tuning the parameter α, the scale-free network capacity measured by the order parameter is considerably enhanced compared to the normal next-nearest-neighbor strategy. Traffic dynamics both near and far away from the critical generating rate Rc are discussed, and it is found that the behavior of 1/f-like noise of the load time series not only depends on the generating rate R but also on the parameter α. We also investigate Rc as functions of C (capacity of nodes), m (connectivity density) and N (network size). Due to the low cost of acquiring next-nearest-neighbor information and the strongly improved network capacity, our strategy may be useful for the protocol designing of modern communication networks.
ISSN:1434-6028
1434-6036
DOI:10.1140/epjb/e2006-00040-2