Scaling of Fluctuations in Traffic on Complex Networks

Jordi Duch and Alex Arenas
Phys. Rev. Lett. 96, 218702 – Published 2 June 2006

Abstract

We study the scaling of fluctuations with the mean of traffic in complex networks using a model where the arrival and departure of “packets” follow exponential distributions, and the processing capability of nodes is either unlimited or finite. The model presents a wide variety of exponents between 1/2 and 1 for this scaling, revealing their dependence on the few parameters considered, and questioning the existence of universality classes. We also report the experimental scaling of the fluctuations in the Internet for the Abilene backbone network. We found scaling exponents between 0.71 and 0.86 that do not fit with the exponent 1/2 reported in the literature.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 10 February 2006

DOI:https://doi.org/10.1103/PhysRevLett.96.218702

©2006 American Physical Society

Authors & Affiliations

Jordi Duch and Alex Arenas

  • Departament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, 43007 Tarragona, Spain

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 96, Iss. 21 — 2 June 2006

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×