Efficient traffic-aware routing strategy on multilayer networks

Author(s):  
Yaqin Hu ◽  
Mingyue Xu ◽  
Ming Tang ◽  
Dingding Han ◽  
Ying Liu
2020 ◽  
pp. 2150078
Author(s):  
Jinlong Ma ◽  
Min Li ◽  
Yaming Li ◽  
Xiangyang Xu ◽  
Weizhan Han ◽  
...  

Traffic dynamics of multilayer networks draws continuous attention from different communities since many systems are actually proved to have a multilayer structure. Since the core nodes of network are prone to congested, an effective routing strategy is of great significance to alleviate the congestion of the multilayer networks. In this paper, we propose an efficient improved routing strategy, with which the core nodes that can reasonably avoid congestion at the high-speed layer in the transmission process of packets, and can also make the most of the traffic resources of the low-speed layer nodes to optimize the traffic capacity of multilayer networks. The simulation results show that the proposed routing strategy can not only improve the network traffic capacity, but also shorten the average path length and average transmission time.


2010 ◽  
Vol 33 (1) ◽  
pp. 36-44
Author(s):  
Ping YE ◽  
Yi-Zhong LI ◽  
Qin XIA

Author(s):  
Ginestra Bianconi

This chapter addresses diffusion, random walks and congestion in multilayer networks. Here it is revealed that diffusion on a multilayer network can be significantly speed up with respect to diffusion taking place on its single layers taken in isolation, and that sometimes it is possible also to observe super-diffusion. Diffusion is here characterized on multilayer network structures by studying the spectral properties of the supra-Laplacian and the dependence on the diffusion constant among different layers. Random walks and its variations including the Lévy Walk are shown to reflect the improved navigability of multilayer networks with more layers. These results are here compared with the results of traffic on multilayer networks that, on the contrary, point out that increasing the number of layers could be detrimental and could lead to congestion.


Author(s):  
Ginestra Bianconi

Defining the centrality of nodes and layers in multilayer networks is of fundamental importance for a variety of applications from sociology to biology and finance. This chapter presents the state-of-the-art centrality measures able to characterize the centrality of nodes, the influences of layers or the centrality of replica nodes in multilayer and multiplex networks. These centrality measures include modifications of the eigenvector centrality, Katz centrality, PageRank centrality and Communicability to the multilayer network scenario. The chapter provides a comprehensive description of the research of the field and discusses the main advantages and limitations of the different definitions, allowing the readers that wish to apply these techniques to choose the most suitable definition for his or her case study.


Sign in / Sign up

Export Citation Format

Share Document