arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0802.3634cs.NI
收藏

基于局部信息的复杂网络数据包传输算法

Local Information Based Algorithms for Packet Transport in Complex Networks

B. Kujawski, G. J. Rodgers, Bosiljka Tadić

摘要:

本文介绍了复杂网络中数据包传输的四种算法。这些算法使用确定性规则,这些规则以不同的方式取决于节点的度、每个边缘向下发送的数据包的数量、每个边缘向下发送到每个目的地的数据包的平均传递时间以及自边缘最后发送数据包以来的时间。在无标度网络上,我们所有的算法都比随机游走算法更有效,可以处理更大的负载。我们详细考虑我们的算法的各种属性,例如,我们表明,一个算法,根据其决定的平均交货时间堵塞,除非它结合了信息的程度的目的地节点。

英文摘要:

We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node, the number of packets posted down each edge, the mean delivery time of packets sent down each edge to each destination and the time since an edge last transmitted a packet. On scale-free networks all our algorithms are considerably more efficient and can handle a larger load than the random walk algorithm. We consider in detail various attributes of our algorithms, for instance we show that an algorithm that bases its decisions on the mean delivery time jams unless it incorporates information about the degree of the destination node.

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

↑