Maximum transport capacity of a network

G Liu, Y Li, J Guo, Z Li - Physica A: Statistical Mechanics and its …, 2015 - Elsevier
The transport capacity of a network can be enhanced and the congestion can be controlled
by improving routing algorithms. Its upper limit is, however, unknown in detail. This study …

Optimization of transport protocols in complex networks

L Chen, J Chen, ZH Guan, XH Zhang… - Physica A: Statistical …, 2012 - Elsevier
In this paper, an optimal routing strategy is proposed to enhance the traffic capacity of
complex networks. In order to avoid nodes overloading, the new algorithm is derived on the …

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 …

Efficient routing on complex networks

G Yan, T Zhou, B Hu, ZQ Fu, BH Wang - Physical Review E—Statistical …, 2006 - APS
We propose a routing strategy to improve the transportation efficiency on complex networks.
Instead of using the routing strategy for shortest path, we give a generalized routing …

Efficient packet routing strategy in complex networks

H Kawamoto, A Igarashi - Physica A: Statistical Mechanics and its …, 2012 - Elsevier
We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …

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 …

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 …

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 …

Optimizing transport in a homogeneous network

M Durand, D Weaire - Physical Review E—Statistical, Nonlinear, and Soft …, 2004 - APS
Many situations in physics, biology, and engineering consist of the transport of some
physical quantity through a network of narrow channels. The ability of a network to transport …

Traffic of packets with non-homogeneously selected destinations in scale-free network

X Ling, R Jiang, X Wang, MB Hu, QS Wu - Physica A: Statistical mechanics …, 2008 - Elsevier
In this paper, we study the information traffic flow in communication networks with scale-free
topology. We consider the situation arising when packets are delivered to non …