Skip to main navigation Skip to search Skip to main content

An optimal routing strategy on scale-free networks

  • Yibo Yang*
  • , Honglin Zhao
  • , Jinlong Ma
  • , Zhaohui Qi
  • , Yongbin Zhao
  • *Corresponding author for this work
  • School of Electronics and Information Engineering, Harbin Institute of Technology
  • Shijiazhuang Tiedao University

Research output: Contribution to journalArticlepeer-review

Abstract

Traffic is one of the most fundamental dynamical processes in networked systems. With the traditional shortest path routing (SPR) protocol, traffic congestion is likely to occur on the hub nodes on scale-free networks. In this paper, we propose an improved optimal routing (IOR) strategy which is based on the betweenness centrality and the degree centrality of nodes in the scale-free networks. With the proposed strategy, the routing paths can accurately bypass hub nodes in the network to enhance the transport efficiency. Simulation results show that the traffic capacity as well as some other indexes reflecting transportation efficiency are further improved with the IOR strategy. Owing to the significantly improved traffic performance, this study is helpful to design more efficient routing strategies in communication or transportation systems.

Original languageEnglish
Article number1750087
JournalInternational Journal of Modern Physics C
Volume28
Issue number7
DOIs
StatePublished - 1 Jul 2017
Externally publishedYes

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 9 - Industry, Innovation, and Infrastructure
    SDG 9 Industry, Innovation, and Infrastructure

Keywords

  • Scale-free networks
  • betweenness centrality
  • degree centrality
  • routing strategy
  • traffic capacity

Fingerprint

Dive into the research topics of 'An optimal routing strategy on scale-free networks'. Together they form a unique fingerprint.

Cite this