1
|
Gao L, Shu P, Tang M, Wang W, Gao H. Effective traffic-flow assignment strategy on multilayer networks. Phys Rev E 2019; 100:012310. [PMID: 31499882 DOI: 10.1103/physreve.100.012310] [Citation(s) in RCA: 21] [Impact Index Per Article: 4.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/16/2017] [Indexed: 11/07/2022]
Abstract
An efficient flow assignment strategy is of great importance to alleviate traffic congestion on multilayer networks. In this work, by considering the roles of nodes' local structures on the microlevel, and the different transporting speeds of layers in the macrolevel, an effective traffic-flow assignment strategy on multilayer networks is proposed. Both numerical and semianalytical results indicate that our proposed flow assignment strategy can reasonably redistribute the traffic flow of the low-speed layer to the high-speed layer. In particular, preferentially transporting the packets through small-degree nodes on the high-speed layer can enhance the traffic capacity of multilayer networks. We also find that the traffic capacity of multilayer networks can be improved by increasing the network size and the average degree of the high-speed layer. For a given multilayer network, there is a combination of optimal macrolevel parameter and optimal microlevel parameter with which the traffic capacity can be maximized. It is verified that real-world network topology does not invalidate the results. The semianalytical predictions agree with the numerical simulations.
Collapse
Affiliation(s)
- Lei Gao
- College of Information Science and Engineering, Shandong Agricultural University, Taian 271018, China.,Web Sciences Center, University of Electronic Science and Technology of China, Chengdu 610054, China
| | - Panpan Shu
- School of Sciences, Xi'an University of Technology, Xi'an 710054, China
| | - Ming Tang
- School of Mathematical Sciences, Shanghai Key Laboratory of PMMP, East China Normal University, Shanghai 200241, China.,Shanghai Key Laboratory of Multidimensional Information Processing, East China Normal University, Shanghai 200241, China
| | - Wei Wang
- Cybersecurity Research Institute, Sichuan University, Chengdu 610065, China
| | - Hui Gao
- Web Sciences Center, University of Electronic Science and Technology of China, Chengdu 610054, China
| |
Collapse
|
2
|
Zhou D, Elmokashfi A. Overload-based cascades on multiplex networks and effects of inter-similarity. PLoS One 2017; 12:e0189624. [PMID: 29252988 PMCID: PMC5734698 DOI: 10.1371/journal.pone.0189624] [Citation(s) in RCA: 10] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/20/2017] [Accepted: 11/29/2017] [Indexed: 12/03/2022] Open
Abstract
Although cascading failures caused by overload on interdependent/interconnected networks have been studied in the recent years, the effect of overlapping links (inter-similarity) on robustness to such cascades in coupled networks is not well understood. This is an important issue since shared links exist in many real-world coupled networks. In this paper, we propose a new model for load-based cascading failures in multiplex networks. We leverage it to compare different network structures, coupling schemes, and overload rules. More importantly, we systematically investigate the impact of inter-similarity on the robustness of the whole system under an initial intentional attack. Surprisingly, we find that inter-similarity can have a negative impact on robustness to overload cascades. To the best of our knowledge, we are the first to report the competition between the positive and the negative impacts of overlapping links on the robustness of coupled networks. These results provide useful suggestions for designing robust coupled traffic systems.
Collapse
Affiliation(s)
- Dong Zhou
- Simula Research Laboratory, 1325 Lysaker, Norway
| | | |
Collapse
|
3
|
Shen Z, Cao S, Wang WX, Di Z, Stanley HE. Locating the source of diffusion in complex networks by time-reversal backward spreading. Phys Rev E 2016; 93:032301. [PMID: 27078360 DOI: 10.1103/physreve.93.032301] [Citation(s) in RCA: 67] [Impact Index Per Article: 8.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/04/2015] [Indexed: 11/07/2022]
Abstract
Locating the source that triggers a dynamical process is a fundamental but challenging problem in complex networks, ranging from epidemic spreading in society and on the Internet to cancer metastasis in the human body. An accurate localization of the source is inherently limited by our ability to simultaneously access the information of all nodes in a large-scale complex network. This thus raises two critical questions: how do we locate the source from incomplete information and can we achieve full localization of sources at any possible location from a given set of observable nodes. Here we develop a time-reversal backward spreading algorithm to locate the source of a diffusion-like process efficiently and propose a general locatability condition. We test the algorithm by employing epidemic spreading and consensus dynamics as typical dynamical processes and apply it to the H1N1 pandemic in China. We find that the sources can be precisely located in arbitrary networks insofar as the locatability condition is assured. Our tools greatly improve our ability to locate the source of diffusion in complex networks based on limited accessibility of nodal information. Moreover, they have implications for controlling a variety of dynamical processes taking place on complex networks, such as inhibiting epidemics, slowing the spread of rumors, pollution control, and environmental protection.
Collapse
Affiliation(s)
- Zhesi Shen
- School of Systems Science, Beijing Normal University, Beijing, 100875, P. R. China
| | - Shinan Cao
- School of Finance, University of International Business and Economics, Beijing, 100029, P. R. China
| | - Wen-Xu Wang
- School of Systems Science, Beijing Normal University, Beijing, 100875, P. R. China.,Business School, University of Shanghai for Science and Technology, Shanghai 200093, China
| | - Zengru Di
- School of Systems Science, Beijing Normal University, Beijing, 100875, P. R. China
| | - H Eugene Stanley
- Department of Physics, Boston University, Boston, Massachusetts 02215, USA
| |
Collapse
|
4
|
Cui H, Liu X, Li L. The architecture of dynamic reservoir in the echo state network. CHAOS (WOODBURY, N.Y.) 2012; 22:033127. [PMID: 23020466 DOI: 10.1063/1.4746765] [Citation(s) in RCA: 14] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/01/2023]
Abstract
Echo state network (ESN) has recently attracted increasing interests because of its superior capability in modeling nonlinear dynamic systems. In the conventional echo state network model, its dynamic reservoir (DR) has a random and sparse topology, which is far from the real biological neural networks from both structural and functional perspectives. We hereby propose three novel types of echo state networks with new dynamic reservoir topologies based on complex network theory, i.e., with a small-world topology, a scale-free topology, and a mixture of small-world and scale-free topologies, respectively. We then analyze the relationship between the dynamic reservoir structure and its prediction capability. We utilize two commonly used time series to evaluate the prediction performance of the three proposed echo state networks and compare them to the conventional model. We also use independent and identically distributed time series to analyze the short-term memory and prediction precision of these echo state networks. Furthermore, we study the ratio of scale-free topology and the small-world topology in the mixed-topology network, and examine its influence on the performance of the echo state networks. Our simulation results show that the proposed echo state network models have better prediction capabilities, a wider spectral radius, but retain almost the same short-term memory capacity as compared to the conventional echo state network model. We also find that the smaller the ratio of the scale-free topology over the small-world topology, the better the memory capacities.
Collapse
Affiliation(s)
- Hongyan Cui
- Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China.
| | | | | |
Collapse
|
5
|
Kishore V, Santhanam MS, Amritkar RE. Extreme events and event size fluctuations in biased random walks on networks. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2012; 85:056120. [PMID: 23004834 DOI: 10.1103/physreve.85.056120] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 12/12/2011] [Indexed: 06/01/2023]
Abstract
Random walk on discrete lattice models is important to understand various types of transport processes. The extreme events, defined as exceedences of the flux of walkers above a prescribed threshold, have been studied recently in the context of complex networks. This was motivated by the occurrence of rare events such as traffic jams, floods, and power blackouts which take place on networks. In this work, we study extreme events in a generalized random walk model in which the walk is preferentially biased by the network topology. The walkers preferentially choose to hop toward the hubs or small degree nodes. In this setting, we show that extremely large fluctuations in event sizes are possible on small degree nodes when the walkers are biased toward the hubs. In particular, we obtain the distribution of event sizes on the network. Further, the probability for the occurrence of extreme events on any node in the network depends on its "generalized strength," a measure of the ability of a node to attract walkers. The generalized strength is a function of the degree of the node and that of its nearest neighbors. We obtain analytical and simulation results for the probability of occurrence of extreme events on the nodes of a network using a generalized random walk model. The result reveals that the nodes with a larger value of generalized strength, on average, display lower probability for the occurrence of extreme events compared to the nodes with lower values of generalized strength.
Collapse
|
6
|
Gavalda A, Duch J, Gómez-Gardeñes J. Reciprocal interactions out of congestion-free adaptive networks. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2012; 85:026112. [PMID: 22463284 DOI: 10.1103/physreve.85.026112] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 11/01/2011] [Indexed: 05/31/2023]
Abstract
In this paper we study the jamming transition in complex adaptive networks. We introduce an adaptation mechanism that modifies the weight of the communication channels in order to delay the congestion onset. Adaptivity takes place locally as it is driven by each node of the network. Surprisingly, regardless of the structural properties of the backbone topology, e.g., its degree distribution, the adaptive network can reach optimal functioning provided it allows a reciprocal distribution of the weights. Under this condition, the optimal functioning is achieved through an extensive network reshaping ending up in a highly reciprocal weighted network whose critical onset of congestion is delayed up to its maximum possible value. We also show that, for a given network, the reciprocal weighting obtained from adaptation produce optimal static configurations.
Collapse
Affiliation(s)
- Arnau Gavalda
- Departament d'Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, ES-43007 Tarragona, Spain
| | | | | |
Collapse
|
7
|
Tang M, Zhou T. Efficient routing strategies in scale-free networks with limited bandwidth. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2011; 84:026116. [PMID: 21929073 DOI: 10.1103/physreve.84.026116] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 04/30/2010] [Revised: 03/10/2011] [Indexed: 05/31/2023]
Abstract
We study the traffic dynamics in complex networks where each link is assigned a limited and identical bandwidth. Although the first-in-first-out (FIFO) queuing rule is widely applied in the routing protocol of information packets, here we argue that if we drop this rule, the overall throughput of the network can be remarkably enhanced. We propose some efficient routing strategies that do not strictly obey the FIFO rule. Compared to the routine shortest-path strategy, throughput for both Barabási-Albert (BA) networks and the Internet can be improved by a factor of more than five. We calculate the theoretical limitation of the throughput. In BA networks, our proposed strategy can achieve 88% of the theoretical optimum, yet for the Internet, it is about 12%, implying that we still have a huge space to further improve the routing strategy for the Internet. Finally, we discuss possibly promising ways to design more efficient routing strategies for the Internet.
Collapse
Affiliation(s)
- Ming Tang
- Web Sciences Center, University of Electronic Science and Technology of China, Chengdu 610054, People's Republic of China.
| | | |
Collapse
|
8
|
Kishore V, Santhanam MS, Amritkar RE. Extreme events on complex networks. PHYSICAL REVIEW LETTERS 2011; 106:188701. [PMID: 21635132 DOI: 10.1103/physrevlett.106.188701] [Citation(s) in RCA: 16] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 02/12/2011] [Indexed: 05/30/2023]
Abstract
A wide spectrum of extreme events ranging from traffic jams to floods take place on networks. Motivated by these, we employ a random walk model for transport and obtain analytical and numerical results for the extreme events on networks. They reveal an unforeseen, and yet a robust, feature: small degree nodes of a network are more likely to encounter extreme events than the hubs. Further, we also study the recurrence time distribution and scaling of the probabilities for extreme events. These results suggest a revision of design principles and can be used as an input for designing the nodes of a network so as to smoothly handle extreme events.
Collapse
Affiliation(s)
- Vimal Kishore
- Physical Research Laboratory, Navrangpura, Ahmedabad, India
| | | | | |
Collapse
|
9
|
Meloni S, Gómez-Gardeñes J. Local empathy provides global minimization of congestion in communication networks. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2010; 82:056105. [PMID: 21230543 DOI: 10.1103/physreve.82.056105] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 08/06/2010] [Revised: 10/04/2010] [Indexed: 05/30/2023]
Abstract
We present a mechanism to avoid congestion in complex networks based on a local knowledge of traffic conditions and the ability of routers to self-coordinate their dynamical behavior. In particular, routers make use of local information about traffic conditions to either reject or accept information packets from their neighbors. We show that when nodes are only aware of their own congestion state they self-organize into a hierarchical configuration that delays remarkably the onset of congestion although leading to a sharp first-order-like congestion transition. We also consider the case when nodes are aware of the congestion state of their neighbors. In this case, we show that empathy between nodes is strongly beneficial to the overall performance of the system and it is possible to achieve larger values for the critical load together with a smooth, second-order-like, transition. Finally, we show how local empathy minimize the impact of congestion as much as global minimization. Therefore, here we present an outstanding example of how local dynamical rules can optimize the system's functioning up to the levels reached using global knowledge.
Collapse
Affiliation(s)
- Sandro Meloni
- Dipartimento di Informatica e Automazione, Universitá degli studi Roma Tre, Via della Vasca Navale, 79 00146 Roma, Italy
| | | |
Collapse
|
10
|
Huang W, Chow TWS. Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free network. CHAOS (WOODBURY, N.Y.) 2010; 20:033123. [PMID: 20887063 DOI: 10.1063/1.3490745] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/29/2023]
Abstract
In this paper, we propose an efficient strategy to enhance traffic capacity via the process of nodes and links increment. We show that by adding shortcut links to the existing networks, packets are avoided flowing through hub nodes. We investigate the performances of our proposed strategy under the shortest path routing strategy and the local routing strategy. Our obtained results show that using the proposed strategy, the traffic capacity can be effectively enhanced under the shortest path routing strategy. Under the local routing strategy, the obtained results show that the proposed strategy is efficient only when packets are more likely to be forwarded to low-degree nodes in their routing paths. Compared with other strategies, the obtained results indicate that our proposed strategy of adding nodes and links is the most effective in enhancing the traffic capacity, i.e., the traffic capacity can be maximally enhanced with the least number of additional nodes and links.
Collapse
Affiliation(s)
- Wei Huang
- Department of Electronic Engineering, City University of Hong Kong, Hong Kong, People's Republic of China
| | | |
Collapse
|