Optimal structure of complex networks for minimizing traffic congestion.
Optimal structure of complex networks for minimizing traffic congestion.
复制标题
DOI：
10.1063/1.2790367
复制
发表时间：
2007-10
期刊：
影响因子：
2.9
通讯作者：
Liang Zhao;T. Cupertino;Kwangho Park;Y. Lai;Xiaogang Jin
中科院分区：
文献类型：
--
作者：
Liang Zhao;T. Cupertino;Kwangho Park;Y. Lai;Xiaogang Jin
为了设计复杂的网络以最大限度地减少流量拥塞，有必要了解流量如何依赖于网络结构。研究了复杂网络中数据包的传输问题，其中每个节点的数据包传输能力是不固定的。推导出最小化流量拥堵的最佳容量配置，并确定临界数据包生成速率，低于该速率时网络处于自由流状态，高于该速率时发生拥堵。我们的分析揭示了网络拓扑结构和流量之间的直接关系。最佳的网络结构，没有流量拥塞，应该有两个特点：均匀分布的负载在所有节点和小的网络直径。数值模拟证实了这一发现。我们的分析也使得有可能从理论上比较不同类型的复杂网络的拥塞条件。特别是，我们发现，低临界生成率的网络更容易受到拥塞。我们对以下复杂网络拓扑结构进行了比较：随机、无标度和规则。
To design complex networks to minimize traffic congestion, it is necessary to understand how traffic flow depends on network structure. We study data packet flow on complex networks, where the packet delivery capacity of each node is not fixed. The optimal configuration of capacities to minimize traffic congestion is derived and the critical packet generating rate is determined, below which the network is at a free flow state but above which congestion occurs. Our analysis reveals a direct relation between network topology and traffic flow. Optimal network structure, free of traffic congestion, should have two features: uniform distribution of load over all nodes and small network diameter. This finding is confirmed by numerical simulations. Our analysis also makes it possible to theoretically compare the congestion conditions for different types of complex networks. In particular, we find that network with low critical generating rate is more susceptible to congestion. The comparison has been made on the following complex-network topologies: random, scale-free, and regular.