PARALLEL ALGORITHMS FOR MULTICORE ROUTERS IN LARGE COMPUTER NETWORKS – A REVIEW

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.