Related papers: Communication Bottlenecks in Scale-Free Networks
Complex networks are characterized by several topological properties: degree distribution, clustering coefficient, average shortest path length, etc. Using a simple model to generate scale-free networks embedded on geographical space, we…
Several studies on real complex networks from different fields as biology, economy, or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like $P(k)\approx…
This paper derives a lower bound to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius $n^\gamma$, $ \gamma \geq 0$, propagation is modeled by…
It has been found that the networks with scale-free distribution are very resilient to random failures. The purpose of this work is to determine the network design guideline which maximize the network robustness to random failures with the…
Random scale-free overlay topologies provide a number of properties like for example high resilience against failures of random nodes, small (average) diameter as well as good expansion and congestion characteristics that make them…
We model information traffic on scale-free networks by introducing the node queue length L proportional to the node degree and its delivering ability C proportional to L. The simulation gives the overall capacity of the traffic system,…
We investigate topologically biased failure in scale-free networks with degree distribution $P(k) \propto k^{-\gamma}$. The probability $p$ that an edge remains intact is assumed to depend on the degree $k$ of adjacent nodes $i$ and $j$…
We investigate the percentage of delivering capacities that are actually consumed in a typical traffic dynamics where the capacities are uniformly assigned over a scale-free network. Theoretical analysis, as well as simulations, reveal that…
The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands?…
We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node, the number of packets posted down each edge, the mean delivery time…
Empirical studies on the spatial structures in several real transport networks reveal that the distance distribution in these networks obeys power law. To discuss the influence of the power-law exponent on the network's structure and…
Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communication network system is said to be stable if the number of…
We study the problem of interference management in fast fading wireless networks, in which the transmitters are only aware of network topology. We consider a class of retransmission-based schemes, where transmitters in the network are only…
Large real-world networks are typically scale-free. Recent research has shown that such graphs are described best in a geometric space. More precisely, the internet can be mapped to a hyperbolic space such that geometric greedy routing…
We investigate the statistics of the most connected nodes in scale-free networks. For a scale-free network model with homogeneous nodes, we show by means of extensive simulations that the exponential truncation--due to the finite size of…
This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized…
We consider spatial stochastic models, which can be applied e.g. to telecommunication networks with two hierarchy levels. In particular, we consider two Cox processes concentrated on the edge set of a random tessellation, where the points…
In this paper, we address the problem of broadcasting in a wireless network under a novel communication model: the {\em swamping} communication model. In this model, nodes communicate only with those nodes at geometric distance greater than…
Recent results from statistical physics show that large classes of complex networks, both man-made and of natural origin, are characterized by high clustering properties yet strikingly short path lengths between pairs of nodes. This class…
A new model about cascading occurrences caused by perturbation is established to search after the mechanism because of which catastrophes in networks occur. We investigate the avalanche dynamics of our model on 2-dimension Euclidean…