Traffic dynamics in scale-free networks

Attila Fekete, G. Vattay, Ljupco Kocarev

Research output: Article

25 Citations (Scopus)

Abstract

We study traffic dynamics in growing scale-free networks. Both the scale-free structure of the network and the adaptive nature of the dynamics which controls traffic in the network are considered in the model. The model is investigated with computer simulations and analytically for the case of a scale-free tree. For the scale-free tree, an exact formula and its power law approximation of the complementary cumulative distribution function of link load (edge betweenness) is presented. We examine whether the scaling properties of the network affect the performance of the transport mechanism and estimate the average number of competing transport mechanisms at bottlenecks. We find that bottlenecks tend to appear on the periphery of the network as the performance increases. Various bandwidth allocation strategies are compared. We show that the best performance is achieved when capacity is distributed proportionally to the expected load of links. We demonstrate that it is necessary to study both the topology and the dynamics of the transport mechanism to understand the whole system.

Original languageEnglish
Pages (from-to)97-107
Number of pages11
JournalComplexus
Volume3
Issue number1-3
DOIs
Publication statusPublished - aug. 2006

Fingerprint

traffic
Computer Simulation
cumulative distribution
computer simulation
topology

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)
  • Genetics

Cite this

Traffic dynamics in scale-free networks. / Fekete, Attila; Vattay, G.; Kocarev, Ljupco.

In: Complexus, Vol. 3, No. 1-3, 08.2006, p. 97-107.

Research output: Article

Fekete, A, Vattay, G & Kocarev, L 2006, 'Traffic dynamics in scale-free networks', Complexus, vol. 3, no. 1-3, pp. 97-107. https://doi.org/10.1159/000094192
Fekete, Attila ; Vattay, G. ; Kocarev, Ljupco. / Traffic dynamics in scale-free networks. In: Complexus. 2006 ; Vol. 3, No. 1-3. pp. 97-107.
@article{bd224a176d104dc390561b97806688d0,
title = "Traffic dynamics in scale-free networks",
abstract = "We study traffic dynamics in growing scale-free networks. Both the scale-free structure of the network and the adaptive nature of the dynamics which controls traffic in the network are considered in the model. The model is investigated with computer simulations and analytically for the case of a scale-free tree. For the scale-free tree, an exact formula and its power law approximation of the complementary cumulative distribution function of link load (edge betweenness) is presented. We examine whether the scaling properties of the network affect the performance of the transport mechanism and estimate the average number of competing transport mechanisms at bottlenecks. We find that bottlenecks tend to appear on the periphery of the network as the performance increases. Various bandwidth allocation strategies are compared. We show that the best performance is achieved when capacity is distributed proportionally to the expected load of links. We demonstrate that it is necessary to study both the topology and the dynamics of the transport mechanism to understand the whole system.",
keywords = "Internet, Scale-free network, Simulations, Transmission Control Protocol",
author = "Attila Fekete and G. Vattay and Ljupco Kocarev",
year = "2006",
month = "8",
doi = "10.1159/000094192",
language = "English",
volume = "3",
pages = "97--107",
journal = "Complexus",
issn = "1424-8492",
publisher = "S. Karger AG",
number = "1-3",

}

TY - JOUR

T1 - Traffic dynamics in scale-free networks

AU - Fekete, Attila

AU - Vattay, G.

AU - Kocarev, Ljupco

PY - 2006/8

Y1 - 2006/8

N2 - We study traffic dynamics in growing scale-free networks. Both the scale-free structure of the network and the adaptive nature of the dynamics which controls traffic in the network are considered in the model. The model is investigated with computer simulations and analytically for the case of a scale-free tree. For the scale-free tree, an exact formula and its power law approximation of the complementary cumulative distribution function of link load (edge betweenness) is presented. We examine whether the scaling properties of the network affect the performance of the transport mechanism and estimate the average number of competing transport mechanisms at bottlenecks. We find that bottlenecks tend to appear on the periphery of the network as the performance increases. Various bandwidth allocation strategies are compared. We show that the best performance is achieved when capacity is distributed proportionally to the expected load of links. We demonstrate that it is necessary to study both the topology and the dynamics of the transport mechanism to understand the whole system.

AB - We study traffic dynamics in growing scale-free networks. Both the scale-free structure of the network and the adaptive nature of the dynamics which controls traffic in the network are considered in the model. The model is investigated with computer simulations and analytically for the case of a scale-free tree. For the scale-free tree, an exact formula and its power law approximation of the complementary cumulative distribution function of link load (edge betweenness) is presented. We examine whether the scaling properties of the network affect the performance of the transport mechanism and estimate the average number of competing transport mechanisms at bottlenecks. We find that bottlenecks tend to appear on the periphery of the network as the performance increases. Various bandwidth allocation strategies are compared. We show that the best performance is achieved when capacity is distributed proportionally to the expected load of links. We demonstrate that it is necessary to study both the topology and the dynamics of the transport mechanism to understand the whole system.

KW - Internet

KW - Scale-free network

KW - Simulations

KW - Transmission Control Protocol

UR - http://www.scopus.com/inward/record.url?scp=33748188530&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748188530&partnerID=8YFLogxK

U2 - 10.1159/000094192

DO - 10.1159/000094192

M3 - Article

AN - SCOPUS:33748188530

VL - 3

SP - 97

EP - 107

JO - Complexus

JF - Complexus

SN - 1424-8492

IS - 1-3

ER -