Please login to be able to save your searches and receive alerts for new content matching your search criteria.
In order to alleviate traffic congestion on multilayer networks, designing an efficient routing strategy is one of the most important ways. In this paper, a novel routing strategy is proposed to reduce traffic congestion on two-layer networks. In the proposed strategy, the optimal paths in the physical layer are chosen by comprehensively considering the roles of nodes’ degrees of the two layers. Both numerical and analytical results indicate that our routing strategy can reasonably redistribute the traffic load of the physical layer, and thus the traffic capacity of two-layer complex networks are significantly enhanced compared with the shortest path routing (SPR) and the global awareness routing (GAR) strategies. This study may shed some light on the optimization of networked traffic dynamics.
The network topology and the routing strategy are major factors to affect the traffic dynamics of the network. In this work, we aim to design an optimal time-varying network structure and an efficient route is allocated to each user in the network. The network topology is designed by considering addition, removal and rewiring of links. At each time instant, a new node connects with an existing node based on the degree and correlation with its neighbor. Traffic congestion is handled by rewiring of some congested links along with the removal of the anti-preferential and correlated links. Centrality plays an important role to find the most important node in the network. The more a node is central, the more it can be used for the shortest route of the user pairs and it can be congested due to a large number of data coming from its neighborhood. Therefore, routes of the users are selected such that the sum of the centrality of the nodes appearing in the user’s route is minimum. Thereafter, we analyze the network structure by using various network properties such as the clustering coefficient, centrality, average shortest path, rich club coefficient, average packet travel time and order parameter.
The rise of socio-technical systems in which humans interact with various forms of Artificial Intelligence, including assistants and recommenders, multiplies the possibility for the emergence of large-scale social behavior, possibly with unintended negative consequences. In this work, we discuss a particularly interesting case, i.e., navigation services’ impact on urban emissions, showing through simulations that the sum of many individually “optimal” choices may have unintended negative outcomes because such choices influence and interfere with each other on top of shared resources. To prove this point, we demonstrate how the introduction of a random component in the path suggestion phase may help to relieve the effect of collective and individual choices on the urban environment in terms of urban emissions.