A neural network method for minimum delay routing in packet-switched networks

✍ Scribed by G Feng; C Douligers

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 147 KB
• Volume: 24
• Category: Article
• ISSN: 0140-3664
• DOI: 10.1016/s0140-3664(00)00224-3

✦ Synopsis

In this paper, a neural networks (NNs) based two-phase routing algorithm is proposed. The aim of the ®rst phase is to ®nd a set of alternative routes for each commodity, while the traf®c of each commodity is optimally distributed on the alternative routes in the second phase. Our ®nal goal is to route all messages so that the average time delay of a message is minimized. Since the Hop®eld neural network (HNN) can only solve problems whose energy functions can be expressed as quadratic forms, the expression of the average time delay of a packet needs ®rst to be simpli®ed and then explicitly included into the energy function. Our algorithm is applied to two network models, both of which have been previously analyzed by other researchers using mathematical methods. Compared with previous results, the proposed algorithm considerably reduces the time delay a packet encounters. A large number of experiments also indicate that the proposed algorithm has very good stability. Our work provides a possible routing policy for future high-speed communication networks due to the fact that a hardware-implemented NN can achieve an extremely high response speed.