An efficient link closing strategy for improving traffic capacity on scale-free networks

J Zhang, J Ma, HJ Li - Physica A: Statistical Mechanics and its Applications, 2022 - Elsevier
Network structure and its traffic capacity are closely related. A reasonable layout of the
network structure can bring a larger traffic capacity. In this paper, a high-contraction …

Method to enhance traffic capacity for scale-free networks

Z Liu, MB Hu, R Jiang, WX Wang, QS Wu - Physical Review E—Statistical …, 2007 - APS
In this paper, a method is proposed to enhance the traffic handling capacity of scale-free
networks by closing or cutting some links between some large-degree nodes, for both local …

Enhancing traffic capacity of scale-free networks by link-directed strategy

J Ma, W Han, Q Guo, S Zhang - International Journal of Modern …, 2016 - World Scientific
The transport efficiency of a network is strongly related to the underlying structure. In this
paper, we propose an efficient strategy named high-betweenness-first (HBF) for the purpose …

Routing in scale-free networks based on expanding betweenness centrality

ZH Guan, L Chen, TH Qian - Physica A: Statistical mechanics and its …, 2011 - Elsevier
In this paper, an improved routing strategy is proposed for enhancing the traffic capacity of
scale-free networks. Instead of using the information of degree and betweenness centrality …

Enhancing traffic capacity for scale-free networks by the one-way links

K Hu, C Liu, T Hu, Y Tang - Journal of Physics A: Mathematical …, 2010 - iopscience.iop.org
We propose a method to enhance the traffic handling capacity of scale-free networks by
enforcing the undirected links to be unidirectional ones, for the global shortest-path routing …

Effective strategy of adding links for improving network transport efficiency on complex networks

S Zhang, MG Liang, ZY Jiang, JJ Wu - International Journal of …, 2014 - World Scientific
In this paper, we propose an efficient strategy to enhance the network transport efficiency by
adding links to the existing networks. In our proposed strategy, we consider both the node …

Incremental routing strategy on scale-free networks

ZY Jiang, MG Liang - Physica A: Statistical Mechanics and its Applications, 2013 - Elsevier
The most important function of a network is for transporting traffic. Due to the low traffic
capacity of network systems under the global shortest path routing, plenty of heuristic routing …

A congestion awareness routing strategy for scale-free networks with tunable clustering

ZY Chen, XF Wang - Physica A: Statistical Mechanics and its Applications, 2006 - Elsevier
By incorporating local traffic information into the basic shortest path routing policy, we
propose a congestion awareness routing strategy with a tunable parameter. We investigate …

An efficient strategy for enhancing traffic capacity by removing links in scale-free networks

W Huang, TWS Chow - Journal of statistical mechanics: Theory …, 2010 - iopscience.iop.org
An efficient link-removal strategy, called the variance-of-neighbor-degree-reduction (VNDR)
strategy, for enhancing the traffic capacity of scale-free networks is proposed in this paper …

Optimal routing strategy based on the minimum information path

K Wang, Y Zhang, S Zhou, W Pei, S Wang… - Physica A: Statistical …, 2011 - Elsevier
In this paper, we propose a new routing strategy based on the minimum information path,
named the optimal routing (OR) strategy, to improve the transportation capacity of scale-free …