Author(s)

Takayuki Kimura, Tohru Ikeguchi, Chi K. Tse

Department of Electrical and Electronic Engineering, Nippon Institute of Technology, Saitama, Japan.
Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hong Kong, China.
Graduate School of Science and Engineering, and Saitama University Brain Science Institute, Saitama University, Saitama, Japan.

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.

Congestion Control; Packet Routing Problems; Decentralized Control; Complex Networks

T. Kimura, T. Ikeguchi and C. Tse, "Efficient Routing Strategy with Memory Information for Complex Networks," American Journal of Operations Research, Vol. 2 No. 1, 2012, pp. 73-81. doi: 10.4236/ajor.2012.21008.