Search

Article

x

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

Optimal traffic routing strategy on scale-free complex networks

Li Tao Pei Wen-Jiang Wang Shao-Ping

Optimal traffic routing strategy on scale-free complex networks

Li Tao, Pei Wen-Jiang, Wang Shao-Ping
PDF
Get Citation
Metrics
  • Abstract views:  3676
  • PDF Downloads:  1623
  • Cited By: 0
Publishing process
  • Received Date:  24 February 2009
  • Accepted Date:  08 April 2009
  • Published Online:  20 September 2009

Optimal traffic routing strategy on scale-free complex networks

  • 1. 东南大学信息科学与工程学院,南京 210096

Abstract: In this paper, we propose a new routing strategy to improve the transportation performance on scale-free networks, named optimal routing strategy. It can proportionally distribute the traffic load between central nodes and the noncentral nodes. Analytical results indicate that by using the optimal routing strategy, the network capability in processing traffic is proportional to the square of the network size and is independent of each node degree. Simulations show that compared with the classic shortest path routing strategy, the new strategy can enhance the network capability several times with the small-world character and its performance is gradually improved with the increasing of the average degree. Moreover, the comparison with the efficient routing strategy also reveals the prominent performance of the new strategy.

Catalog

    /

    返回文章
    返回