arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.0412physics.soc-phcs.SI
收藏

互联复杂网络中的业务拥塞

Traffic congestion in interconnected complex networks

Fei Tan, Jiajing Wu, Yongxiang Xia, Chi K. Tse

摘要:

在过去的十年中,孤立复杂网络中的交通拥塞问题得到了广泛的研究。耦合网络模型是近年来发展起来的一种研究方法,它有助于进一步理解真实的复杂系统。然而,耦合复杂网络中的交通拥塞分析仍然是相对未开发的。在本文中,我们试图探讨在互联BA无标度网络的交通阻塞的影响。我们发现,当节点的处理能力是基于节点的使用概率分配时,竞争性耦合比竞争性和随机耦合更容易缓解交通拥塞。此外,还可以找到最佳的耦合概率为间接耦合。然而,三种类型的耦合偏好实现类似的流量性能,如果所有节点共享相同的处理能力。我们分析了韩国和日本的互联网AS级图,并获得了类似的结果。提出了一些实用的建议,以优化这种现实世界的互联网络。

英文摘要:

Traffic congestion in isolated complex networks has been investigated extensively over the last decade. Coupled network models have recently been developed to facilitate further understanding of real complex systems. Analysis of traffic congestion in coupled complex networks, however, is still relatively unexplored. In this paper, we try to explore the effect of interconnections on traffic congestion in interconnected BA scale-free networks. We find that assortative coupling can alleviate traffic congestion more readily than disassortative and random coupling when the node processing capacity is allocated based on node usage probability. Furthermore, the optimal coupling probability can be found for assortative coupling. However, three types of coupling preferences achieve similar traffic performance if all nodes share the same processing capacity. We analyze interconnected Internet AS-level graphs of South Korea and Japan and obtain similar results. Some practical suggestions are presented to optimize such real-world interconnected networks accordingly.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑