An Optimal Routing Strategy Based on Specifying Shortest Path

Yonghua Xu, Fei Shao

Abstract


Unlike the shortest path is randomly chosen in the traditional shortest path routing strategy, a novel routing strategy to improve the network transportation capacity is proposed in this paper. According to the different characteristics of the nodes along actual paths, we specify the shortest paths of all pairs of nodes aiming at reducing the betweenness of those high-betweenness nodes. Simulations on both computer-generated and real-world networks show that the new routing strategy can enhance the network transportation capacity greatly. And it works better in those networks with the fuzzy community structure.

 

DOI: http://dx.doi.org/10.11591/telkomnika.v11i10.2963


Keywords


optimal routing strategy; network transportation capacity; community structure; complex networks

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics