Improved routing strategies for data traffic in scale-free networks

ZX Wu, G Peng, WM Wong… - Journal of Statistical …, 2008 - iopscience.iop.org
We study the information packet routing process in scale-free networks by mimicking Internet
traffic delivery. We incorporate both the global shortest paths information and local degree …

Congestion in different topologies of traffic networks

JJ Wu, ZY Gao, HJ Sun, HJ Huang - Europhysics letters, 2006 - iopscience.iop.org
In the present paper, we consider three different types of networks (random, small-world,
and scale-free) with dynamic weights and focus on how the characteristic parameters …

Topological-based bottleneck analysis and improvement strategies for traffic networks

JJ Wu, ZY Gao, HJ Sun - Science in China Series E: Technological …, 2009 - Springer
A method is proposed to find key components of traffic networks with homogenous and
heterogeneous topologies, in which heavier traffic flow is transported. One component …

Effective usage of shortest paths promotes transportation efficiency on scale-free networks

WB Du, ZX Wu, KQ Cai - Physica A: statistical mechanics and its …, 2013 - Elsevier
With rapid economic and social development, the problem of traffic congestion is getting
more and more serious. Accordingly, network traffic models have attracted extensive …

Effective traffic-flow assignment strategy on multilayer networks

L Gao, P Shu, M Tang, W Wang, H Gao - Physical Review E, 2019 - APS
An efficient flow assignment strategy is of great importance to alleviate traffic congestion on
multilayer networks. In this work, by considering the roles of nodes' local structures on the …

Traffic dynamics on two-layer complex networks with limited delivering capacity

J Ma, W Han, Q Guo, Z Wang - Physica A: Statistical Mechanics and its …, 2016 - Elsevier
The traffic dynamics of multi-layer networks has attracted a great deal of interest since many
real networks are comprised of two or more layers of subnetworks. Due to its low traffic …

Adaptive local routing strategy on a scale-free network

L Feng, Z Han, L Ming, R Feng-Yuan… - Chinese Physics …, 2010 - iopscience.iop.org
Due to the heterogeneity of the structure on a scale-free network, making the
betweennesses of all nodes become homogeneous by reassigning the weights of nodes or …

A hybrid routing model for mitigating congestion in networks

K He, Z Xu, P Wang - Physica A: Statistical Mechanics and its Applications, 2015 - Elsevier
Imbalance between fast-growing transport demand and limited network supply has resulted
in severe congestion in many transport networks. Increasing network supply or reducing …

Investigation of both local and global topological ingredients on transport efficiency in scale-free networks

W Huang, TWS Chow - Chaos: An Interdisciplinary Journal of …, 2009 - pubs.aip.org
This paper investigates the combined effect of local and global topological ingredients for
routing packets on transport efficiency in scale-free networks with different degree …

Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length

Y Shen, G Ren, Y Liu - Physica A: Statistical Mechanics and its Applications, 2016 - Elsevier
In this paper, we propose a biased-shortest path method with minimal congestion. In the
method, we use linear-prediction to estimate the queue length of nodes, and propose a …