Efficient routing strategy with transmission history information and its surrogate analysis
Efficient routing strategy with transmission history information and its surrogate analysis
复制标题
DOI：
10.1016/j.physa.2020.125597
复制
发表时间：
2021-03
影响因子：
3.3
通讯作者：
Akinori Yoshida;Yutaka Shimada;T. Kimura
中科院分区：
文献类型：
--
作者：
Akinori Yoshida;Yutaka Shimada;T. Kimura
在通信网络中，为数据包寻找从源到目的地的最优最短路径被称为数据包路由问题。在分组路由问题中，分组在网络中的分布总是随时间而变化。因此，不能保证当前时间的最短路径也是下一时间的最短路径。为了解决这些问题，已经提出了一种使用本地传输历史信息的路由方法，该方法显示出有效的性能。然而，它仍然是未知的，什么样的拓扑结构，这种方法表现出优异的性能，以及如何传输历史信息的作品，以减少数据包拥塞。为此，我们在这里全面评估使用内存信息的路由方法。数值模拟表明，利用记忆信息的路由方法在异构通信网络中表现出良好的性能。此外，我们的方法使用代理数据的分析表明，传输历史信息是有用的分散在通信网络中的分组拥塞。
Obtaining the optimum shortest paths for packets from their sources to destinations in communication networks is referred to as the packet routing problem. In a packet routing problem, the distribution of packets in the network always changes with time. Therefore, there is no guarantee that the shortest route at the current time is also the shortest one at the next time. For addressing these problems, a routing method using local transmission history information has already been proposed; this method shows effective performance. However, it is still unknown what kinds of topologies this method shows excellent performance for and how the transmission history information works to reduce packet congestion. To this end, we herein comprehensively evaluate the routing method using memory information. Numerical simulations clarify that the routing method using memory information shows excellent performance for heterogeneous type communication networks. Further, analysis of our method using surrogate data revealed that the transmission history information is useful for decentralizing packet congestion in communication networks.