Efficient routing strategy with memory information for complex networks

T. Kimura, T. Ikeguchi, Chi Kong Tse

Research output: Journal article publicationJournal articleAcademic research

26 Citations (Scopus)


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 accumulat- ing 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 in- corporate 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.
Original languageEnglish
Pages (from-to)73-81
Number of pages9
JournalAmerican journal of operations research
Issue number1
Publication statusPublished - Mar 2012


  • Congestion control
  • Packet routing problems
  • Decentralized control
  • Complex networks


Dive into the research topics of 'Efficient routing strategy with memory information for complex networks'. Together they form a unique fingerprint.

Cite this