Efficient routing on complex networks
Gang Yan, Tao Zhou, Bo Hu, Zhong-Qian Fu, Bing-Hong Wang
Abstract
In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called efficient path, which considers the possible congestion in the nodes along actual paths. Since the nodes with largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our new strategy, can be as redistributing traffic load in central nodes to other non-central nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.
Create a lesson
Related papers
Coupling spherical p-spin systems
Riccardo Cipolloni, Leticia F. Cugliandolo
Bias-Induced Crossover in Absolute Capacity of Dense Associative Memory
Yuto Sakurai, Takeaki Shimokawa, Kazunori Iwata et al.
Latent kinetic Ising models of neural spike trains
Davide Ghio, David Saad
Nonlocal Magic across the Many-Body Localization Crossover
Shan-Zhong Li, Zhi Li
Statistical levels and spatial modes of Fock-space heterogeneity in many-body localization crossovers
Yu-Jing Liu, Chen Cheng
Disorder-Tailored Delocalization
Yeongjun Kim, Supriyo Ghosh, Sergej Flach