基于局部信息的无标度网络高效路由
Efficient routing on scale-free networks based on local information
摘要：
在这封信中，我们提出了一个新的路由策略与一个单一的自由参数$α$只基于本地信息的网络拓扑结构。为了最大化底层结构的分组处理能力，可以通过从自由流到拥塞的连续相变的临界点来测量，寻求最佳值的$α$。通过研究自由状态下各节点的队长分布，解释了选择最优的$α$可以提高网络的传输能力。此外，还研究了临界点后的动力学性质。有趣的是，它被发现，虽然系统进入拥塞状态，它仍然具有部分交付能力，不依赖于$α$。这一现象表明，网络的容量可以通过增加小的重要节点，承担严重拥塞的转发能力。
英文摘要：
In this letter, we propose a new routing strategy with a single free parameter $α$ only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of $α$ is sought out. By investigating the distributions of queue length on each node in free state, we give an explanation why the delivering capacity of the network can be enhanced by choosing the optimal $α$. Furthermore, dynamic properties right after the critical point are also studied. Interestingly, it is found that although the system enters the congestion state, it still possesses partial delivering capability which do not depend on $α$. This phenomenon suggests that the capacity of the network can be enhanced by increasing the forwarding ability of small important nodes which bear severe congestion.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
