Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    An efficient routing strategy for traffic dynamics on two-layer complex networks

    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.

  • articleNo Access

    Effect of correlation on the traffic capacity of time-varying communication network

    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.