[HTML][HTML] Dynamic Source Routing Strategy for Two-Level Flows on Scale-Free Networks

ZY Jiang, MG Liang, JJ Wu - Plos one, 2013 - journals.plos.org
Packets transmitting in real communication networks such as the Internet can be classified
as time-sensitive or time-insensitive. To better support the real-time and time-insensitive …

Local routing protocols performance for computer virus elimination in complex networks

AOB Alweimine, O Bamaarouf, A Rachadi… - Physica A: Statistical …, 2019 - Elsevier
Although extensive research has been devoted to treat virus propagation over decades, the
effect of local routing protocols algorithms on it has been ignored. In this paper, we studied …

A backup algorithm for power communication network based on fault cascade in the network virtualization environment

X Zhen, L Rui, X Qiu, B Li, P Yu - NOMS 2018-2018 IEEE/IFIP …, 2018 - ieeexplore.ieee.org
This paper studies the multi-layer structure of coupled power network based on the problem
of fault cascade and unreasonable network design in the network virtualization environment …

An efficient weighted routing strategy for scale-free networks

ZY Jiang, MG Liang, JL Huang, Q Li - Modern Physics Letters B, 2012 - World Scientific
Considering the link congestion based traffic model, which can more accurately model the
traffic diffusing process of many real complex systems such as the Internet, we propose an …

A scoring mechanism for the rank aggregation of network robustness

A Yazdani, L Dueñas-Osorio, Q Li - Communications in Nonlinear Science …, 2013 - Elsevier
To date, a number of metrics have been proposed to quantify inherent robustness of network
topology against failures. However, each single metric usually only offers a limited view of …

Hierarchical Dynamic Routing in Complex Networks via Topologically-decoupled and Cooperative Reinforcement Learning Agents

S Hu, S Xiao - arXiv preprint arXiv:2207.00763, 2022 - arxiv.org
The transport capacity of a communication network can be characterized by the transition
from a free-flow state to a congested state. Here, we propose a dynamic routing strategy in …

Effect of dormant spare capacity on the attack tolerance of complex networks

SS Das, K Raman - Physica A: Statistical Mechanics and its Applications, 2022 - Elsevier
The vulnerability of networks to targeted attacks is an issue of widespread interest for
policymakers, military strategists, network engineers and systems biologists alike. Current …

通过最小化边缘添加中的代数连接度来减少电网级联故障传播

S LONAPALAWONG, YAN Jiangzhe, LI Jiayu… - Frontiers, 2022 - jzus.zju.edu.cn
在各种情况下分析网络鲁棒性通常被认为是一个具有挑战性的问题. 应对故障的鲁棒性是大型
动态网络系统(如电力网, 运输系统, 通信系统和计算机网络) 的基本特性之一 …

An incremental optimal routing strategy for scale-free networks

ZY Jiang - International Journal of Modern Physics C, 2014 - World Scientific
The link congestion based traffic model can more accurately reveal the traffic dynamics of
many real complex networks such as the Internet, and heuristically optimizing each link's …

[HTML][HTML] Adaptive variable neighborhood search-based supply network reconfiguration for robustness enhancement

P Lou, Y Chen, S Gao - Complexity, 2020 - hindawi.com
Robustness of a supply network highly depends on its structure. Although structural design
methods have been proposed to create supply networks with optimal robustness, a real-life …