A packet routing strategy using neural networks on scale-free networks

✍ Scribed by Yuki Naganuma; Akito Igarashi

• Publisher: Elsevier Science
• Year: 2010
• Tongue: English
• Weight: 379 KB
• Volume: 389
• Category: Article
• ISSN: 0378-4371
• DOI: 10.1016/j.physa.2009.09.048

✦ Synopsis

We propose a dynamic packet routing strategy by using neural networks on scale-free networks. In this strategy, in order to determine the nodes to which the packets should be transmitted, we use path lengths to the destinations of the packets, and adjust the connection weights of the neural networks attached to the nodes from local information and the path lengths. The performances of this strategy on scale-free networks which have the same degree distribution and different degree correlations are compared to one another. Our numerical simulations confirm that this routing strategy is more effective than the shortest path based strategy on scale-free networks with any degree correlations and that the performance of our strategy on assortative scale-free networks is better than that on disassortative and uncorrelated scale-free networks.