Traffic of particles in complex networks
Traffic of particles in complex networks
复制标题
DOI：
10.1103/physreve.74.036117
复制
发表时间：
2006-09-01
影响因子：
2.4
通讯作者：
de Moura, Alessandro P. S.
中科院分区：
文献类型：
--
作者：
Germano, Renato;de Moura, Alessandro P. S.
对通过通信网络（例如因特网）的信息流的研究是非常重要的。在互联网中，信息以离散的单位（“包”）流动，计算机存储和处理信息的能力是有限的。因此，如果有许多数据包同时在网络上行走，它们将相互干扰。为了理解这一点，我们提出了一个理想化的模型，其中许多粒子在网络上随机移动，节点支持有限数量的粒子。节点所支持的分组的最大数量可以是任何正整数，并且对于每个节点可以不同。我们分析了该模型的统计特性，获得了每个节点的平均占用，不同的网络拓扑结构的解析表达式。分析结果与数值模拟结果一致。
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.