Academic Journals Database
Disseminating quality controlled scientific knowledge

Efficient Routing Strategy with Memory Information for Complex Networks

ADD TO MY LIST
 
Author(s): Takayuki Kimura | Tohru Ikeguchi | Chi K. Tse

Journal: American Journal of Operations Research
ISSN 2160-8830

Volume: 02;
Issue: 01;
Start page: 73;
Date: 2012;
Original page

Keywords: Congestion Control | Packet Routing Problems | Decentralized Control | Complex Networks

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.

Tango Jona
Tangokurs Rapperswil-Jona

     Save time & money - Smart Internet Solutions