相关论文: Load distribution in small world networks

Small-world networks are ubiquitous in real-life systems. Most previous models of small-world networks are stochastic. The randomness makes it more difficult to gain a visual understanding on how do different nodes of networks interact with…

We study diffusion and consensus dynamics in a Network of Networks model. In this model, there is a collection of sub-networks, connected to one another using a small number of links. We consider a setting where the links between networks…

This work addresses the problem of evaluating optimal link capacities of a packet-flow network for the objective of congestion minimization. We present a simple model of packet flow in networks and present a numerical approach to evaluate…

The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the…

Community structure is common in many real networks, with nodes clustered in groups sharing the same connections patterns. While many community detection methods have been developed for networks with binary edges, few of them are applicable…

In order to maintain consistent quality of service, computer network engineers face the task of monitoring the traffic fluctuations on the individual links making up the network. However, due to resource constraints and limited access, it…

The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has $x$ requests to transmit, then it receives a fraction of the capacity proportional to…

Understanding how contagions (information, infections, etc) are spread on complex networks is important both from practical as well as theoretical point of view. Considerable work has been done in this regard in the past decade or so.…

This paper proposes the first distributed algorithm that solves the weight-balancing problem using only finite rate and simplex communications among nodes, compliant with the directed nature of the graph edges. It is proved that the…

We study the emergence of congestion patterns in urban networks by modeling vehicular interaction by means of a simple traffic rule and by using a set of measures inspired by the standard Betweenness Centrality (BC). We consider a…

This paper studies the statistical properties of the web of import-export relationships among world countries using a weighted-network approach. We analyze how the distributions of the most important network statistics measuring…

We present a simple model to predict network activity at the edge level, by extending a known approximation method to compute Betweenness Centrality (BC) with a repulsive mechanism to prevent unphysical densities. By taking into account the…

Finding the important nodes in complex networks by topological structure is of great significance to network invulnerability. Several centrality measures have been proposed recently to evaluate the performance of nodes based on their…

We study a problem of data packet transport in scale-free networks whose degree distribution follows a power-law with the exponent $\gamma$. We define load at each vertex as the accumulated total number of data packets passing through that…

We give an intuitive though general explanation of the finite-size effect in scale-free networks in terms of the degree distribution of the starting network. This result clarifies the relevance of the starting network in the final degree…

Communication networks show the small-world property of short paths, but the spreading dynamics in them turns out slow. We follow the time evolution of information propagation through communication networks by using the SI model with…

A complete understanding of real networks requires us to understand the consequences of the uneven interaction strengths between a system's components. Here we use the minimum spanning tree (MST) to explore the effect of weight assignment…

The small-world phenomenon has been already the subject of a huge variety of papers, showing its appeareance in a variety of systems. However, some big holes still remain to be filled, as the commonly adopted mathematical formulation…

This paper studies the network throughput and transport delay of a multihop wireless random access network based on a Markov renewal model of packet transportation. We show that the distribution of the source-to-destination (SD) distance…

In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…