Traffic of particles in complex networks

Research output: Contribution to journalArticle

32 Citations (Scopus)

Abstract

The study of the information flow through communication networks, such as the Internet, is of great importance. In the Internet, information flows in discrete units ("packets"), and the capacity of storage and processing of information of computers is finite. Thus if there are many packets walking on the network at the same time, they will interfere with each other. To understand this, we propose an idealized model, in which many particles move randomly on the network, and the nodes support limited numbers of particles. The maximum number of packets supported by a node can be any positive integer, and can be different for each node. We analyze the statistical properties of this model, obtaining analytical expressions for the mean occupation of each node, for different network topologies. The analytical results are shown to be in agreement with numerical simulations.

Original languageEnglish
Article number036117
JournalPhysical Review. E, Statistical, Nonlinear and Soft Matter Physics
Volume74
Issue number3 Part 2
Publication statusPublished - Sep 2006

Fingerprint

Complex Networks
traffic
information flow
Traffic
Information Flow
Vertex of a graph
walking
communication networks
occupation
integers
topology
Communication Networks
Network Topology
Statistical property
Analytical Model
Numerical Simulation
Unit
Integer
simulation
Model

Cite this

Traffic of particles in complex networks. / Germano, A.; de Moura, Alessandro Paula Servio.

In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics, Vol. 74, No. 3 Part 2, 036117, 09.2006.

Research output: Contribution to journalArticle

@article{8ef60fd4aa5a44e08f3936114d2becfb,
title = "Traffic of particles in complex networks",
abstract = "The study of the information flow through communication networks, such as the Internet, is of great importance. In the Internet, information flows in discrete units ({"}packets{"}), and the capacity of storage and processing of information of computers is finite. Thus if there are many packets walking on the network at the same time, they will interfere with each other. To understand this, we propose an idealized model, in which many particles move randomly on the network, and the nodes support limited numbers of particles. The maximum number of packets supported by a node can be any positive integer, and can be different for each node. We analyze the statistical properties of this model, obtaining analytical expressions for the mean occupation of each node, for different network topologies. The analytical results are shown to be in agreement with numerical simulations.",
author = "A. Germano and {de Moura}, {Alessandro Paula Servio}",
year = "2006",
month = "9",
language = "English",
volume = "74",
journal = "Physical Review. E, Statistical, Nonlinear and Soft Matter Physics",
issn = "1539-3755",
publisher = "AMER PHYSICAL SOC",
number = "3 Part 2",

}

TY - JOUR

T1 - Traffic of particles in complex networks

AU - Germano, A.

AU - de Moura, Alessandro Paula Servio

PY - 2006/9

Y1 - 2006/9

N2 - The study of the information flow through communication networks, such as the Internet, is of great importance. In the Internet, information flows in discrete units ("packets"), and the capacity of storage and processing of information of computers is finite. Thus if there are many packets walking on the network at the same time, they will interfere with each other. To understand this, we propose an idealized model, in which many particles move randomly on the network, and the nodes support limited numbers of particles. The maximum number of packets supported by a node can be any positive integer, and can be different for each node. We analyze the statistical properties of this model, obtaining analytical expressions for the mean occupation of each node, for different network topologies. The analytical results are shown to be in agreement with numerical simulations.

AB - The study of the information flow through communication networks, such as the Internet, is of great importance. In the Internet, information flows in discrete units ("packets"), and the capacity of storage and processing of information of computers is finite. Thus if there are many packets walking on the network at the same time, they will interfere with each other. To understand this, we propose an idealized model, in which many particles move randomly on the network, and the nodes support limited numbers of particles. The maximum number of packets supported by a node can be any positive integer, and can be different for each node. We analyze the statistical properties of this model, obtaining analytical expressions for the mean occupation of each node, for different network topologies. The analytical results are shown to be in agreement with numerical simulations.

M3 - Article

VL - 74

JO - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

JF - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

SN - 1539-3755

IS - 3 Part 2

M1 - 036117

ER -