| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 721004 | IFAC Proceedings Volumes | 2007 | 6 Pages |
Abstract
In the paper several classical and new algorithms for calculation of routing tables in large networks, e.g.: Dijkstra, Bellman-Ford, SLF-LLL, auction, Q-routing and ant(swarm)-routing are compared – both theoretically and computationally. The special attention is paid to the possibility of making use of current multicore processors in routers and the effectiveness of the parallel implementations.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Andrzej Karbowski,