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
On the interplay of network structure and routing strategies in scale-free networks
โ Scribed by Walid K. Ghamry; Khaled M. F. Elsayed
- Book ID
- 107635516
- Publisher
- Springer-Verlag
- Year
- 2010
- Tongue
- English
- Weight
- 834 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0003-4347
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The evolution of strategies in the iterated prisoner's dilemma on scale-free networks is investigated. It is found that the smaller the average degree is, the easier it is to promote cooperation by natural selection. Cooperation on scale-free networks built upon big clustering coefficients is enhanc
In her provocative (and informative) article on recent research into power laws in biology, Evelyn Fox Keller implies that this work has not led to research that is self-generating and, above all, that it has not produced significant insights. A refutation of this particular criticism might be base