Title :
Improving communication network topologies using tabu search
Author :
Pierre, S. ; Elgibaoui, A.
Author_Institution :
LICEF Res. Center, Quebec Univ., Montreal, Que., Canada
Abstract :
This paper proposes a tabu search approach for improving communication network topologies. The problem consists of finding, for a given set of nodes and traffic requirements, a network topology that minimizes the communication cost taking into account some performance and reliability constraints. For this purpose, some moves or focal transformations called perturbations are applied to a starting topology in order to reduce the communication cost or the average packet delay. Preliminary results demonstrate the capability of such an approach to improve the communication cost as well as some performance attributes of network topologies
Keywords :
computer network reliability; delays; directed graphs; minimisation; packet switching; performance evaluation; search problems; telecommunication traffic; communication cost; communication cost minimization; communication network topology; directed graph; focal transformations; network traffic requirements; packet delay; packet switched network; performance; perturbations; reliability constraints; tabu search; Communication networks; Computer network reliability; Computer networks; Cost function; Delay; Euclidean distance; Network topology; Routing; Telecommunication network reliability; Telecommunication traffic;
Conference_Titel :
Local Computer Networks, 1997. Proceedings., 22nd Annual Conference on
Conference_Location :
Minneapolis, MN
Print_ISBN :
0-8186-8141-1
DOI :
10.1109/LCN.1997.630901