Efficient Routing Strategy with Memory Information for Complex Networks
Efficient Routing Strategy with Memory Information for Complex Networks
复制标题
DOI：
10.4236/ajor.2012.21008
复制
发表时间：
2012-03
期刊：
影响因子：
--
通讯作者：
T. Kimura;T. Ikeguchi;C. Tse
中科院分区：
文献类型：
--
作者：
T. Kimura;T. Ikeguchi;C. Tse
在本文中，我们提出了一种新的数据包路由策略，采用内存信息，以减少通信网络中的拥塞。首先，我们研究了传统的路由策略，选择路径传输数据包到目的地使用的距离信息和动态信息，如在相邻节点的积累数据包的数量。然后，我们评估这种路由策略的有效性的无标度网络。从数值模拟的结果，我们得出结论，这种路由策略是无效的，当数据包的密度增加，由于通信网络的不可渗透性。为了避免这个不希望的问题，我们将内存信息的路由策略。通过有效地使用存储器信息，分组被传播到通信网络中，对于各种网络拓扑（诸如无标度网络、小世界网络和具有社区结构的无标度网络）实现比常规路由策略更高的性能。
In this paper, we propose a new packet routing strategy that incorporates memory information for reducing congestion in communication networks. First, we study the conventional routing strategy which selects the paths for transmitting packets to destinations using the distance information and the dynamical information such as the number of accumulating packets at adjacent nodes. Then, we evaluate the effectiveness of this routing strategy for the scale-free networks. From results of numerical simulations, we conclude that this routing strategy is not effective when the density of the packets increases due to the impermeability of the communication network. To avoid this undesirable problem, we incorporate memory information to the routing strategy. By using memory information effectively, packets are spread into the communication networks, achieving a higher performance than conventional routing strategies for various network topologies, such as scale-free networks, small-world networks, and scale-free networks with community structures.