Model for dynamic traffic congestion in scale-free networks

The nodes with the largest degree are very susceptible to traffic congestion, thus an effective way to improve traffic and control congestion can be redistributing traffic load in hub nodes to others. We proposed an efficient routing strategy, which can remarkably enhance the network throughput. In addition, by using detrended fluctuation analysis, we found that the traffic rate fluctuation near the critical point exhibits the 1/f scaling in the power spectrum, which is in accordance with the empirical data.

Download Full-text

An optimal routing strategy on scale-free networks

International Journal of Modern Physics C ◽

10.1142/s0129183117500875 ◽

2017 ◽

Vol 28 (07) ◽

pp. 1750087 ◽

Cited By ~ 4

Author(s):

Yibo Yang ◽

Honglin Zhao ◽

Jinlong Ma ◽

Zhaohui Qi ◽

Yongbin Zhao

Keyword(s):

Traffic Congestion ◽

Transportation Systems ◽

Optimal Routing ◽

Shortest Path Routing ◽

Transport Efficiency ◽

Scale Free ◽

Routing Strategy ◽

Traffic Capacity ◽

Traffic Performance ◽

Scale Free Networks

Traffic is one of the most fundamental dynamical processes in networked systems. With the traditional shortest path routing (SPR) protocol, traffic congestion is likely to occur on the hub nodes on scale-free networks. In this paper, we propose an improved optimal routing (IOR) strategy which is based on the betweenness centrality and the degree centrality of nodes in the scale-free networks. With the proposed strategy, the routing paths can accurately bypass hub nodes in the network to enhance the transport efficiency. Simulation results show that the traffic capacity as well as some other indexes reflecting transportation efficiency are further improved with the IOR strategy. Owing to the significantly improved traffic performance, this study is helpful to design more efficient routing strategies in communication or transportation systems.

Download Full-text

Traffic Properties for Stochastic Routing on Scale-Free Networks

IEICE Transactions on Communications ◽

10.1587/transcom.e94.b.1311 ◽

2011 ◽

Vol E94-B (5) ◽

pp. 1311-1322

Author(s):

Yukio HAYASHI ◽

Yasumasa ONO

Keyword(s):

Scale Free ◽

Stochastic Routing ◽

Scale Free Networks

Download Full-text

Dynamics analysis of an online gambling spreading model on scale-free networks

Advances in Difference Equations ◽

10.1186/s13662-020-03165-z ◽

2021 ◽

Vol 2021 (1) ◽

Author(s):

Yu Kong ◽

Tao Li ◽

Yuanmei Wang ◽

Xinming Cheng ◽

He Wang ◽

...

Keyword(s):

Network Topology ◽

Negative Impact ◽

Online Gambling ◽

Basic Reproductive Number ◽

Reproductive Number ◽

Scale Free ◽

Spreading Model ◽

Spreading Dynamics ◽

Scale Free Networks ◽

Gambling Policy

AbstractNowadays, online gambling has a great negative impact on the society. In order to study the effect of people’s psychological factors, anti-gambling policy, and social network topology on online gambling dynamics, a new SHGD (susceptible–hesitator–gambler–disclaimer) online gambling spreading model is proposed on scale-free networks. The spreading dynamics of online gambling is studied. The basic reproductive number $R_{0}$ R 0 is got and analyzed. The basic reproductive number $R_{0}$ R 0 is related to anti-gambling policy and the network topology. Then, gambling-free equilibrium $E_{0}$ E 0 and gambling-prevailing equilibrium $E_{ +} $ E + are obtained. The global stability of $E_{0}$ E 0 is analyzed. The global attractivity of $E_{ +} $ E + and the persistence of online gambling phenomenon are studied. Finally, the theoretical results are verified by some simulations.

Download Full-text