### 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 language | English |
---|---|

Article number | 036117 |

Journal | Physical Review. E, Statistical, Nonlinear and Soft Matter Physics |

Volume | 74 |

Issue number | 3 Part 2 |

Publication status | Published - Sep 2006 |

## Fingerprint Dive into the research topics of 'Traffic of particles in complex networks'. Together they form a unique fingerprint.

## Cite this

Germano, A., & de Moura, A. P. S. (2006). Traffic of particles in complex networks.

*Physical Review. E, Statistical, Nonlinear and Soft Matter Physics*,*74*(3 Part 2), [036117].