Check-in based routing strategy in scale-free networks

ZY Jiang, JF Ma, YL Shen - Physica A: Statistical Mechanics and its …, 2017 - Elsevier
In many real complex artificial networks, a navigation route between a pair of source and
destination is often desired to pass through at least a specified node called check-in node …

Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free network

W Huang, TWS Chow - Chaos: an interdisciplinary journal of nonlinear …, 2010 - pubs.aip.org
In this paper, we propose an efficient strategy to enhance traffic capacity via the process of
nodes and links increment. We show that by adding shortcut links to the existing networks …

Effective gravitation path routing strategy on scale-free networks

J Ma, J Zhang, Y Zhang - IEEE Access, 2021 - ieeexplore.ieee.org
Information routing strategy is a hot issue in the study of complex network traffic dynamics. In
this paper, we define a new gravitational centrality and introduce parameter α 1 to control …

An efficient routing strategy on spatial scale-free networks

XM Guan, XJ Zhang, Y Zhu, I Hwang… - International Journal of …, 2014 - World Scientific
Traffic dynamics has drawn much more attention recently, but most current research barely
considers the space factor, which is of critical importance in many real traffic systems. In this …

[HTML][HTML] A maximum algebraic connectivity increment edge-based strategy for capacity enhancement in scale-free networks

G Li, ZF Hao, H Huang, H Wei, XM Yan - Physics Letters A, 2019 - Elsevier
In this paper, we focus on how to improve transportation efficiency of scale-free networks via
edge increments. Based on analyzing the correlation between algebraic connectivity, which …

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 …

An efficient routing strategy for traffic dynamics on two-layer complex networks

J Ma, H Wang, Z Zhang, Y Zhang, C Duan… - International Journal of …, 2018 - World Scientific
In order to alleviate traffic congestion on multilayer networks, designing an efficient routing
strategy is one of the most important ways. In this paper, a novel routing strategy is proposed …

Analysis of traffic flow on complex networks

K Li, X Gong, S Guan, CH Lai - International Journal of Modern …, 2011 - World Scientific
We propose a new routing strategy for controlling packet routing on complex networks. The
delivery capability of each node is adopted as a piece of local information to be integrated …

Efficient edge rewiring strategies for enhancement in network capacity

S Kumari, A Saroha, A Singh - Physica A: Statistical Mechanics and its …, 2020 - Elsevier
The structure of the network has great impact on its traffic dynamics. Most of the real world
networks follow heterogeneous structure and exhibit scale-free feature. In scale-free …

Multi-priority routing algorithm based on source node importance in complex networks

Y Bai, DD Han, M Tang - International Journal of Modern Physics C, 2019 - World Scientific
Network transmission capacity is an important guarantee for the normal operation of the
network. The effective routing strategy avoids the use of nodes with large degree value …