Efficient Routing Strategy with Memory Information for Complex Networks

  • Kimura T
  • Ikeguchi T
  • Tse C
N/ACitations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

We propose in this paper a new routing method that utilizes hop distance information and transmitting history. Most of conventional routing methods use global and real-time information such as the number of waiting packets at nodes, and they assumed in the network model that these real-time information can be accessed instantaneously at every node. These unrealistic network circumstances, however, limit applicability of routing methods. On the other hand, our proposed method in this paper uses transmitting histories held by each node to diversify routes of packets. In addition, any packets to exchange global information is not necessary. Numerical simulations indicate that our proposed method shows higher arrival rate of packets for scale-free type communication network models. Futhermore, we analyze the time-series of the memoy information at each node using the surrogete techniques used basically in the field of nonlinear time-series analysis. Analytical results then show that the high-order statistical properties in memoy information effectively works to avoid the congestion in networks.

Cite

CITATION STYLE

APA

Kimura, T., Ikeguchi, T., & Tse, C. K. (2012). Efficient Routing Strategy with Memory Information for Complex Networks. American Journal of Operations Research, 02(01), 73–81. https://doi.org/10.4236/ajor.2012.21008

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free