Share Email Print

Proceedings Paper

Effect of random failures on traffic in complex networks
Author(s): Jordi Duch; Alex Arenas
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We study the effect of random removal of nodes in networks on the maximum capability to deliver information in communication processes. Measuring the changes on the onset of congestion, we observe different behaviors depending on the network structure, governed by the distribution of the algorithmic betweenness (number of paths traversing a node given a communication protocol) of the nodes, and particularly by the node with the highest betweenness. We also compare the robustness of networks from a topological and dynamical point of view. We find that for certain values of traffic load, after suffering a random failure, the network can be physically connected but the nodes are unable to communicate due congestion. These results highlight the necessity to include dynamical considerations in studies about resilience of complex networks.

Paper Details

Date Published: 15 June 2007
PDF: 8 pages
Proc. SPIE 6601, Noise and Stochastics in Complex Systems and Finance, 66010O (15 June 2007); doi: 10.1117/12.724685
Show Author Affiliations
Jordi Duch, Univ. Rovira i Virgili (Spain)
Alex Arenas, Univ. Rovira i Virgili (Spain)

Published in SPIE Proceedings Vol. 6601:
Noise and Stochastics in Complex Systems and Finance
János Kertész; Stefan Bornholdt; Rosario N. Mantegna, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?