Search

Abstract: By incorporating local traffic information into the shortest path routing strategy, we numerically investigate the effectiveness of the traffic awareness routing strategy for scale-free networks with different clustering. In order to characterize the efficiency of the packet-delivery process, we introduce an order parameter and an average transmission time that allow us to measure the network capacity by the critical value of phase transition from free flow to congestion. Compared with the shortest path routing protocol, the network capacity is greatly enhanced by the traffic awareness routing strategy. We also find that there exists an optimum value for the tunable parameter in the congestion awareness strategy. Moreover, simulation results show that the more clustered the network, the less efficient the packet-delivery process. [Copyright &y& Elsevier]

Abstract: Synchronization in classes of continuous-time dynamical unweighted networks with different topologies is investigated. A synchronization-optimal network model based on rewiring of links is proposed. Compared with other networks, it exhibits a stronger synchronizability. We presented link density and investigated the correlation of synchronizability, link density and heterogeneity in degree distribution. In this work, it will be shown that synchronizability of Type I networks is independent of heterogeneity in the degree distribution when the link density is smaller than 0.02. Synchronizability and link density are proportional. When the link density is larger than 0.025, heterogeneity decides the curve slope. The synchronizability of Type II networks is drastically enhanced by enhancing the link density when the link density is smaller than 0.025. However synchronizability increases weakly by enhancing the link density when the link density is larger than 0.025. [Copyright &y& Elsevier]