Share This Article:

Efficient Routing Strategy with Memory Information for Complex Networks

Full-Text HTML XML Download Download as PDF (Size:2177KB) PP. 73-81
DOI: 10.4236/ajor.2012.21008    4,609 Downloads   8,049 Views Citations

ABSTRACT

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.

Cite this paper

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.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.