A Tabu Search algorithm for dynamic routing in ATM cell-switching networks

Authors:
P. Cortes;J. Muñuzuri;L. Onieva;J. Fernández
Affiliations:
Seville University, Grupo Ingeniería Organización, Escuela Superior Ingenieros, Camino de los Descubrimientos s/n, Sevilla 41092, Spain;Seville University, Grupo Ingeniería Organización, Escuela Superior Ingenieros, Camino de los Descubrimientos s/n, Sevilla 41092, Spain;Seville University, Grupo Ingeniería Organización, Escuela Superior Ingenieros, Camino de los Descubrimientos s/n, Sevilla 41092, Spain;Seville University, Grupo Ingeniería Organización, Escuela Superior Ingenieros, Camino de los Descubrimientos s/n, Sevilla 41092, Spain
Venue:
Applied Soft Computing
Year:
2011

Citing 5
Cited 1

Adaptive Call Admission Control Based on Enhanced Genetic Algorithm in Wireless/Mobile Network

ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
A genetic algorithm for solving virtual topology configuration transition problem in WDM network

Computer Communications
Algorithms for IP network design with end-to-end QoS constraints

Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion

Optical Switching and Networking
Genetic algorithms for multiple multicast on WDM ring network

Computer Communications

Cell assignment in hybrid CMOS/nanodevices architecture using Tabu Search

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the dynamic routing problem in ATM cell-switching networks. We present a mathematical programming model based on cell loss and a Tabu Search algorithm with short-term memory that is reinforced with a long-term memory procedure. The estimation of the quality of the solutions is fast due to the specific encoding of the feasible solutions. The Tabu Search algorithm reaches good quality solutions outperforming other approaches such as Genetic Algorithms and the Minimum Switching Path heuristic attending both to the cell loss and the CPU time consumption. The best results were found for the more complex networks with a high number of switches and links.