A new algorithm for packet routing problems using chaotic neurodynamics and its surrogate analysis

Neural Computing and Applications

Volumn 16, Issue 6, 2007, Pages 519-526

  Kimura, Takayuki ^a   Ikeguchi, Tohru ^a  

^a SAITAMA UNIVERSITY   (Japan)

Author keywords

Chaotic neurodynamics; Complex network; Computer network; Decentralized control; Packet routing

Indexed keywords

EID: 34547765728     PISSN: 09410643     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00521-007-0099-5     Document Type: Article

References (25)

1. Hsu DF, Kraetzl M, Sibeyn JF (1998) Packet routing in fixed-connection networks: a survey. J Parallel Distribut Comput 54(2):77-132
2. Caro D, Dorigo G (1998) Antnet: distributed stigmergetic control for communications networks. J Artif Intell Res 9:317-365
3. Amin KA, Mikler AR (2004) Agent-based distance vector routing: a resource effciennt and scalable approach to routing in large communication networks. J Syst Softw 71(3):215-227
4. Bertsekas D, Gallager R (1987) Data networks. Prentice Hall, Englewood Cliffs, USA
5. Fu L, Rilett LR (1998) Expected shortest paths in dynamic and stochastic traffic networks. Transp Res 32(7):499-516
6. Ohira T, Sawatari T (1998) Phase transition in computer network traffic model. Phys Rev E 58(1):193-195
7. Arenas A, Diaz-Guilera A, Guimera R (2001) Communication in networks with hierarchial branching. Phys Rev Lett 86(14):3196-3199
8. Zhao L, Lai YC, Park K, Ye N (2005) Onset of traffic congestion in complex networks. Phys Rev E 71(2):026125
9. Horiguchi T, Ishioka S (2001) Routing control of packet flow using a neural network. Physica A 297:521-531
10. Horiguchi T, Hayashi K, Tretiakov A (2005) Reinforcement learning for congestion-avoidance in packet flow. Physica A 349:329-348
11. Kimura T, Nakajima H, Ikeguchi T (2007) A packet routing method for complex networks by a stochastic neural network. Physica A 376:658-672
12. Aihara K, Tanabe T, Toyoda M (1990) Chaotic neural network. Phys Lett A 144:333-340
13. Hasegawa M, Ikeguchi T, Aihara K(1997) Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems. Phys Rev Lett 79:2344-2347
14. Hasegawa M, Ikeguchi T, Aihara K (2000) Exponential and chaotic neurodynamics tabu searches for quadratic assignment problems. Control Cybern 29:773-788
15. Hasegawa M, Ikeguchi T, Aihara K, Itoh K (2002) A novel chaotic search for quadratic assignment problems. Eur J Oper Res 139:543-556
16. Glover F (1989) Tabu search I. ORSA J Comput 1:190-206
17. Glover F (1990) Tabu search II. ORSA J Comput 2:4-32
18. Hasegawa M, Ikeguchi T, Aihara K (2002) Solving large scale traveling salesman problems by chaotic neurodynamics. Neural Netw 15:271-283
19. Mardhana E, Ikeguchi T (2003) Neurosearch: A program library for neural network driven search meta-heuristics. In: Proceedings of 2003 IEEE international symposium on circuits and systems, pp 697-700
20. Matsuura T, Ikeguchi T, Horio Y (2005) Tabu search and chaotic search for extracting motifs from DNA sequences. In: Proceedings of the 6th metaheuristics international conference, pp 677-682
21. Ikeguchi T (2005) Combinatorial optimization with chaotic dynamics. In: Proceedings of 2005 RISP international workshop on nonlinear circuits and signal processing, pp 263-266
22. Hoshino T, Kimura T, Ikeguchi T (2007) A metaheuristic algorithm for solving vehicle routing problems with soft time windows by chaotic neurodynamics (in Japanese). IEICE Trans Fundamentals J90-A:431-441
23. Barábsi A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509-512
24. Kantz H, Schreiber T (2003) Nonlinear time series analysis. Cambridge University Press, London
25. Yamada T, Aihara K (1997) Nonlinear neurodynamics and combinatorial optimization in chaotic neural networks. J Intell Fuzzy Syst 5:53-68