A tabu search based routing optimization algorithm for packet switching networks

Authors:
Daniele Casali;Giovanni Costantini;Massimo Carota
Affiliations:
Department of Electronic Engineering, University of Rome "Tor Vergata", Roma, Italy;Department of Electronic Engineering, University of Rome "Tor Vergata", Roma, Italy and Institute of acoustics "O. M. Corbino", Roma, Italy;Department of Electronic Engineering, University of Rome "Tor Vergata", Roma, Italy
Venue:
ICC'07 Proceedings of the 11th Conference on Proceedings of the 11th WSEAS International Conference on Circuits - Volume 11
Year:
2007

Citing 2
Cited 0

Ant-based load balancing in telecommunications networks

Adaptive Behavior
Implementation of Recurrent Neural Network Algorithm for Shortest Path Calculation in Network Routing

ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a tabu-search based algorithm that optimizes routing for packet switching networks. The problem of routing optimization can be seen as the search of the shortest path in a graph, where the bandwidths of connections, together with their traffic, can be considered as weights. This kind of optimization is usually carried out by means of the well-known Dijkstra algorithm or its various implementations. However, an exhaustive research tends to be very heavy, from a computational point of view, when the number of nodes gets high. For this reason, we opt for a meta-heuristic algorithm, particularly tabu search, capable of finding a non-optimal solution, that can be considered quite good, even without the need of an exhaustive research.