Information transport in multiplex networks

Abstract

In this paper, we study information transport in multiplex networks comprised of two coupled subnetworks. The upper subnetwork, called the logical layer, employs the shortest paths protocol to determine the logical paths for packets transmission, while the lower subnetwork acts as the physical layer, in which packets are delivered by the biased random walk mechanism characterized with a parameter $\alpha$. Through simulation, we obtain the optimal $\alpha$ corresponding to the maximum network lifetime and the maximum number of the arrival packets. Assortative coupling is better than the random coupling and the disassortative coupling, since it achieves much better transmission performances. Generally, the more homogeneous the lower subnetwork, the better the transmission performances are, which is opposite for the upper subnetwork. Finally, we propose an attack centrality for nodes based on the topological information of both subnetworks, and further investigate the transmission performances under targeted attacks. Our work helps to understand the spreading and robustness issues of multiplex networks and provides some clues about the designing of more efficient and robust routing architectures in communication systems.

arXiv comment7figures

References in corpus (21)

• Emergence of scaling in random networks
• The structure and dynamics of multilayer networks
• Universal Behavior of Load Distribution in Scale-free Networks
• Dynamical interplay between awareness and epidemic spreading in multiplex networks
• Efficient routing on complex networks
• Communication in networks with hierarchical branching
• Improved routing strategies for Internet traffic delivery
• Percolation in Multiplex Networks with Overlap
• Optimal routing on complex networks
• Integrating static and dynamic information for routing traffic
• Epidemics in partially overlapped multiplex networks
• Towards real-world complexity: an introduction to multiplex networks
• Traffic congestion in interconnected complex networks
• k-Core percolation on multiplex networks
• Biased imitation in coupled evolutionary games in interdependent networks
• Weak percolation on multiplex networks
• Epidemic spreading and risk perception in multiplex networks: a self-organized percolation method
• Efficient routing on multilayered communication networks
• Traffic dynamics in scale-free networks with limited packet-delivering capacity
• Transportation dynamics on networks of mobile agents
• Random Walks on Complex Networks

Cited by in corpus (7)

• Comprehensive routing strategy on multilayer networks
• Suppressing traffic-driven epidemic spreading by use of the efficient routing protocol
• Suppressing traffic-driven epidemic spreading by adaptive routing strategy
• Information transmission on hybrid networks
• Collaborative similarity analysis of multilayer developer-project bipartite network
• Multiple predator based capture process on complex networks
• Bufferless transmission in complex networks