14,611 research outputs found
Jamming transition in air transportation networks
In this work we present a model of an air transportation traffic system from
the complex network modelling viewpoint. In the network, every node corresponds
to a given airport, and two nodes are connected by means of flight routes. Each
node is weighted according to its load capacity, and links are weighted
according to the Euclidean distance that separates each pair of nodes. Local
rules describing the behavior of individual nodes in terms of the surrounding
flow have been also modelled, and a random network topology has been chosen in
a baseline approach. Numerical simulations describing the diffusion of a given
number of agents (aircraft) in this network show the onset of a jamming
transition that distinguishes an efficient regime with null amount of airport
queues and high diffusivity (free phase) and a regime where bottlenecks
suddenly take place, leading to a poor aircraft diffusion (congested phase).
Fluctuations are maximal around the congestion threshold, suggesting that the
transition is critical. We then proceed by exploring the robustness of our
results in neutral random topologies by embedding the model in heterogeneous
networks. Specifically, we make use of the European air transportation network
formed by 858 airports and 11170 flight routes connecting them, which we show
to be scale-free. The jamming transition is also observed in this case. These
results and methodologies may introduce relevant decision making procedures in
order to optimize the air transportation traffic
Efficient routing strategies in scale-free networks with limited bandwidth
We study the traffic dynamics in complex networks where each link is assigned
a limited and identical bandwidth. Although the first-in-first-out (FIFO)
queuing rule is widely applied in the routing protocol of information packets,
here we argue that if we drop this rule, the overall throughput of the network
can be remarkably enhanced. We proposed some efficient routing strategies that
do not strictly obey the FIFO rule. Comparing with the routine shortest path
strategy, the throughput for both Barab\'asi-Albert (BA) networks and the real
Internet, the throughput can be improved more than five times. We calculate the
theoretical limitation of the throughput. In BA networks, our proposed strategy
can achieve 88% of the theoretical optimum, yet for the real Internet, it is
about 12%, implying that we have a huge space to further improve the routing
strategy for the real Internet. Finally we discuss possibly promising ways to
design more efficient routing strategies for the Internet.Comment: 5 pages, 4 figure
The effects of spatial constraints on the evolution of weighted complex networks
Motivated by the empirical analysis of the air transportation system, we
define a network model that includes geographical attributes along with
topological and weight (traffic) properties. The introduction of geographical
attributes is made by constraining the network in real space. Interestingly,
the inclusion of geometrical features induces non-trivial correlations between
the weights, the connectivity pattern and the actual spatial distances of
vertices. The model also recovers the emergence of anomalous fluctuations in
the betweenness-degree correlation function as first observed by Guimer\`a and
Amaral [Eur. Phys. J. B {\bf 38}, 381 (2004)]. The presented results suggest
that the interplay between weight dynamics and spatial constraints is a key
ingredient in order to understand the formation of real-world weighted
networks
Impact of network structure on the capacity of wireless multihop ad hoc communication
As a representative of a complex technological system, so-called wireless
multihop ad hoc communication networks are discussed. They represent an
infrastructure-less generalization of todays wireless cellular phone networks.
Lacking a central control authority, the ad hoc nodes have to coordinate
themselves such that the overall network performs in an optimal way. A
performance indicator is the end-to-end throughput capacity.
Various models, generating differing ad hoc network structure via differing
transmission power assignments, are constructed and characterized. They serve
as input for a generic data traffic simulation as well as some semi-analytic
estimations. The latter reveal that due to the most-critical-node effect the
end-to-end throughput capacity sensitively depends on the underlying network
structure, resulting in differing scaling laws with respect to network size.Comment: 30 pages, to be published in Physica
A New Method for Assessing the Resiliency of Large, Complex Networks
Designing resilient and reliable networks is a principle concern of planners and private firms. Traffic congestion whether recurring or as the result of some aperiodic event is extremely costly. This paper describes an alternative process and a model for analyzing the resiliency of networks that address some of the shortcomings of more traditional approaches – e.g., the four-step modeling process used in transportation planning. It should be noted that the authors do not view this as a replacement to current approaches but rather as a complementary tool designed to augment analysis capabilities. The process that is described in this paper for analyzing the resiliency of a network involves at least three steps: 1. assessment or identification of important nodes and links according to different criteria 2. verification of critical nodes and links based on failure simulations and 3. consequence. Raster analysis, graph-theory principles and GIS are used to develop a model for carrying out each of these steps. The methods are demonstrated using two, large interdependent networks for a metropolitan area in the United States.
On resilient control of dynamical flow networks
Resilience has become a key aspect in the design of contemporary
infrastructure networks. This comes as a result of ever-increasing loads,
limited physical capacity, and fast-growing levels of interconnectedness and
complexity due to the recent technological advancements. The problem has
motivated a considerable amount of research within the last few years,
particularly focused on the dynamical aspects of network flows, complementing
more classical static network flow optimization approaches. In this tutorial
paper, a class of single-commodity first-order models of dynamical flow
networks is considered. A few results recently appeared in the literature and
dealing with stability and robustness of dynamical flow networks are gathered
and originally presented in a unified framework. In particular, (differential)
stability properties of monotone dynamical flow networks are treated in some
detail, and the notion of margin of resilience is introduced as a quantitative
measure of their robustness. While emphasizing methodological aspects --
including structural properties, such as monotonicity, that enable tractability
and scalability -- over the specific applications, connections to
well-established road traffic flow models are made.Comment: accepted for publication in Annual Reviews in Control, 201
- …