Information transmission on hybrid networks

Chen, Rongbin; Wei, Chuan‐Yuan; Pu, Cunlai; Li, Jie; Jiang, Bo; Gakis, Konstantinos; Pardalos, Pãnos M.

doi:10.1016/j.physa.2017.08.098

Cited by 4 publications

(1 citation statement)

References 39 publications

(41 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to easily calculate r vivj , we make l = 0 and k = ∞, so, equation (3) becomes as equation (5). Equation (5) is as follows:…”

Section: Gravitational Centralitymentioning

confidence: 99%

Effective Gravitation Path Routing Strategy on Scale-Free Networks

Zhang

2021

IEEE Access

View full text Add to dashboard Cite

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 the centrality of nodes. When α 1 are appropriate values, the gravitational centrality have the function of dividing the centrality of the same degree nodes. According to the gravitational centrality, we propose an effective gravitation path routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates gravitational centrality of nodes in paths. The purpose of this strategy is to improve network traffic capacity. The simulation results on the scale-free network show that our routing strategy is more effective than the efficient routing strategy proposed by Yan et al. [Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top. 73, 046108 (2006)].INDEX TERMS Complex networks, scale-free network, congestion, traffic capacity.

show abstract

“…In order to easily calculate r vivj , we make l = 0 and k = ∞, so, equation (3) becomes as equation (5). Equation (5) is as follows:…”

Section: Gravitational Centralitymentioning

confidence: 99%

Effective Gravitation Path Routing Strategy on Scale-Free Networks

Zhang

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

Packet transmission with a lifetime constraint in scale-free networks

2018

Int. J. Mod. Phys. C

View full text Add to dashboard Cite

In this paper, we study how the lifetime of packets impacts the overall transmission capacity of scale-free communication networks. In our model, we observed an abrupt phase transition of packet loss rate when the packet generation rate increases, based on which we redefined the network capacity as the critical packet generation rate of packet loss. Then, we found a sharp phase transition of network capacity with the increase of packet lifetime, which is also predicted by our analytical results of network capacity. Moreover, we obtained that there is an optimal routing parameter of the tunable path routing algorithm corresponding to the maximum network capacity. Finally, we discussed the influence of network topological structure on the network capacity.

show abstract