In this paper, we propose a routing strategy based on the global dynamic information of network traffic. In the strategy, packets will travel along the path with the minimal sum of links’ weight, which may vary with the traffic condition. During the whole evolution, if the queue length of a...

In this article, we propose a mixing navigation mechanism, which interpolates between random-walk and shortest-path protocol. The navigation efficiency can be remarkably enhanced via a few routers. Some advanced strategies are also designed: For non-geographical scale-free networks, the targeted...

Based on available data on various organisations and networks, the article explores some key properties of the structure of a terrorist organisation. Analytical focus is on lower levels of organisational hierarchy, where network structure with exponential distribution of the number of links...

Using the fact that connections between vertices of a network often represent directed and weighted flows, we apply hydraulic principles to develop novel insights into network structure and growth. We develop a network model based on Bernoulli's principle and use it to analyze changes in network...

The observed structure of protein interaction networks is corrupted by many false positive/negative links. This observational incompleteness is abstracted as random link removal and a specific, experimentally motivated (spoke) link rearrangement. Their impact on the structural properties of...

In this paper, an improved routing strategy is proposed for enhancing the traffic capacity of scale-free networks. Instead of using the information of degree and betweenness centrality, the new algorithm is derived on the basis of the expanding betweenness centrality of nodes, which gives an...

The community structure has been empirically found in many real networks. This paper proposes an efficient Double Shortest Path routing strategy trying to avoid the modules of traffic congestion, which means that we adopt the shortest routing strategy both in the inter-modules and in the...

In this paper, we propose a new routing strategy based on the minimum information path, named the optimal routing (OR) strategy, to improve the transportation capacity of scale-free networks. We define the average routing centrality degree of the node to analyze the traffic load on nodes of...

In this paper, an optimal routing strategy is proposed to enhance the traffic capacity of complex networks. In order to avoid nodes overloading, the new algorithm is derived on the basis of generalized betweenness centrality which gives an estimate of traffic handled by the node for a route set....

In this paper, we study the information traffic flow in communication networks with scale-free topology. We consider the situation arising when packets are delivered to non-homogeneously selected destinations. It is found that the network capacity Rc increases with the increase of 〈k〉...