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.
Autori: | |
Autori: | Casali, D; Costantini, G; Carota, M |
Titolo: | A tabu search based routing optimization algorithm for packet switching networks |
Nome del convegno: | 11th WSEAS International Conference on Circuits |
Luogo del convegno: | Agios Nikolaos, GREECE |
Anno del convegno: | JUL 23-25, 2007 |
Rilevanza: | Rilevanza internazionale |
Data di pubblicazione: | 2007 |
Settore Scientifico Disciplinare: | Settore ING-IND/31 - Elettrotecnica |
Lingua: | English |
Altre informazioni significative: | 5 |
Tipologia: | Intervento a convegno |
Citazione: | 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. |
Appare nelle tipologie: | 02 - Intervento a convegno |