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.

Casali, D., Costantini, G., & Carota, M. (2007). A tabu search based routing optimization algorithm for packet switching networks. In Proceedings of the 11th WSEAS International Conference on Circuits, Vol 1 - CIRCUITS THEORY AND APPLICATIONS (pp.179-183). ATHENS : WORLD SCIENTIFIC AND ENGINEERING ACAD AND SOC.

A tabu search based routing optimization algorithm for packet switching networks

COSTANTINI, GIOVANNI;
2007

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.
11th WSEAS International Conference on Circuits
Agios Nikolaos, GREECE
JUL 23-25, 2007
Rilevanza internazionale
Settore ING-IND/31 - Elettrotecnica
English
tabu search; optimization; routing; communication networks
5
Intervento a convegno
Casali, D., Costantini, G., & Carota, M. (2007). A tabu search based routing optimization algorithm for packet switching networks. In Proceedings of the 11th WSEAS International Conference on Circuits, Vol 1 - CIRCUITS THEORY AND APPLICATIONS (pp.179-183). ATHENS : WORLD SCIENTIFIC AND ENGINEERING ACAD AND SOC.
Casali, D; Costantini, G; Carota, M
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2108/52633
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact