Issue |
Europhys. Lett.
Volume 62, Number 2, April 2003
|
|
---|---|---|
Page(s) | 292 - 298 | |
Section | Interdisciplinary physics and related areas of science and technology | |
DOI | https://doi.org/10.1209/epl/i2003-00140-7 | |
Published online | 01 April 2003 |
Critical load and congestion instabilities in scale-free networks
1
The Abdus Salam International Centre for Theoretical
Physics P.O. Box 586, 34100 Trieste, Italy
2
Departamento de Física Teórica, Universidad de
Zaragoza - Zaragoza 50009, Spain
3
Departament de Física i Enginyeria Nuclear, Universitat
Politècnica de Catalunya Campus Nord, Mòdul B4 - 08034
Barcelona, Spain
4
Department of Physics, University of Notre Dame - 225
Nieuwland Science Hall Notre Dame, IN 46556, USA
5
Laboratoire de Physique Théorique (UMR du CNRS 8627),
Bâtiment 210 Université de Paris-Sud - 91405 Orsay
Cedex, France
Corresponding author: yamir@ictp.trieste.it
Received:
27
November
2002
Accepted:
14
February
2003
We study the tolerance to congestion failures in communication networks with scale-free topology. The traffic load carried by each damaged element in the network must be partly or totally redistributed among the remaining elements. Overloaded elements might fail on their turn, triggering the occurrence of failure cascades able to isolate large parts of the network. We find a critical traffic load above which the probability of massive traffic congestions destroying the network communication capabilities is finite.
PACS: 89.75.-k – Complex systems / 89.75.Fb – Structures and organization in complex systems / 05.70.Jk – Critical point phenomena
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.