Complex Sciences. First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1

Research Article

An Effective Local Routing Strategy on the Communication Network

Download
381 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-02466-5_111,
        author={Yu-jian Li and Bing-hong Wang and Zheng-dong Xi and Chuan-yang Yin and Han-xin Yang and Duo Sun},
        title={An Effective Local Routing Strategy on the Communication Network},
        proceedings={Complex Sciences. First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1},
        proceedings_a={COMPLEX PART 1},
        year={2012},
        month={5},
        keywords={complex networks scale-free local routing strategy},
        doi={10.1007/978-3-642-02466-5_111}
    }
    
  • Yu-jian Li
    Bing-hong Wang
    Zheng-dong Xi
    Chuan-yang Yin
    Han-xin Yang
    Duo Sun
    Year: 2012
    An Effective Local Routing Strategy on the Communication Network
    COMPLEX PART 1
    Springer
    DOI: 10.1007/978-3-642-02466-5_111
Yu-jian Li,*, Bing-hong Wang1,*, Zheng-dong Xi2, Chuan-yang Yin3, Han-xin Yang1, Duo Sun1
  • 1: University of Science and Technology of China
  • 2: Department of Satellite Measurement and Control on Sea of China
  • 3: Nanjing University of Information Science and Technology
*Contact email: jinzhili@mail.ustc.edu.cn, bhwang@ustc.edu.cn

Abstract

In this paper, we propose an effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential cut-off exponent . We assume that the handling capacity of one vertex is proportional to its degree when the degree is smaller than , and is a constant otherwise. 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 nearest-neighbor strategy. Traffic dynamics both near and far away from the critical generating rate are discussed. Simulation results demonstrate that the optimal performance of the system corresponds to = − 0.5. 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.