Information routing is one of the most important problems in large communication networks. In this paper we propose a novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates degrees of nodes in paths. Results on large...

In this paper, we propose a max-flow-min-cost (MFMC) problem to obtain the upper bound of network capacity and develop an efficient packet routing strategy. The MFMC problem is formulated as two linear programs (LP). The optimal solutions of the two LPs are the upper bound of network capacity...

In this paper, we are exploring strategies for the reduction of the congestion in the complex networks. The nodes without buffers are considered, so, if the congestion occurs, the information packets will be dropped. The focus is on the efficient routing. The routing strategies are compared...

The balance between the supply and demand of some kind of resource is critical for the functionality and security of many complex networks. Local contingencies that break this balance can cause a global collapse. These contingencies are usually dealt with by spare capacity, which is costly...

To minimize traffic congestion, understanding how traffic dynamics depend on network structure is necessary. Many real-world complex systems can be described as multilayer structures. In this paper, we introduce the idea of layers to establish a traffic model of two-layer complex networks. By...

Based on the consideration of easy implementation of new routing strategies on many real complex networks such as the Internet, we propose a hybrid routing mechanism composed of the shortest path routing and the global dynamic routing strategy to improve the network traffic capacity. Under the...

In this paper we investigated the structural properties of the ultra high voltage power transmission network of Iran. We modeled the power grid as a network with 105 nodes and 142 connection links. We found that the Iranian power grid displays a relatively moderate clustering coefficient–much...

We investigate and analyse an optimal traffic network structure for resisting traffic congestion with different volumes of traffic. For this aim, we introduce a cost function and user-equilibrium assignment (UE) which ensures the flow balance on traffic systems. Our finding is that an optimal...

We investigate the cluster behavior of financial markets within the framework of a model based on a scale-free network. In this model, a cluster is formed by connected agents that are in the same state. The cumulative distribution of clusters is found to be a power-law. We find that the...

In this study, we investigate the role of zealots on the result of voting process on both scale-free and Watts–Strogatz networks. We observe that inflexible individuals are very effective in consensus achievement and also in the rate of ordering process in complex networks. Zealots make the...