loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
22nd Annual IEEE International Conference on Local Computer Networks (LCN'97)
Improving communication network topologies using tabu search
Minneapolis, MN
November 02-November 05
ISBN: 0-8186-8141-1
ASCII Text
x 
 
S. Pierre, A. Elgibaoui, "Improving communication network topologies using tabu search," Local Computer Networks, Annual IEEE Conference on, pp. 44, 22nd Annual IEEE International Conference on Local Computer Networks (LCN'97), 1997.
 
 
BibTex
x
 
@article{ 10.1109/LCN.1997.630901,
author = {S. Pierre and A. Elgibaoui},
title = {Improving communication network topologies using tabu search},
journal ={Local Computer Networks, Annual IEEE Conference on},
volume = {0},
year = {1997},
issn = {0742-1303},
pages = {44},
doi = {http://doi.ieeecomputersociety.org/10.1109/LCN.1997.630901},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Local Computer Networks, Annual IEEE Conference on
TI - Improving communication network topologies using tabu search
SN - 0742-1303
SP
EP
A1 - S. Pierre,
A1 - A. Elgibaoui,
PY - 1997
KW - search problems; communication network topology; tabu search; network traffic requirements; communication cost minimization; performance; reliability constraints; focal transformations; perturbations; communication cost; packet delay; directed graph; packet switched network
VL - 0
JA - Local Computer Networks, Annual IEEE Conference on
ER -
 
S. Pierre, LICEF Res. Center, Quebec Univ., Montreal, Que., Canada
A. Elgibaoui, LICEF Res. Center, Quebec Univ., Montreal, Que., Canada
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.
Index Terms:
search problems; communication network topology; tabu search; network traffic requirements; communication cost minimization; performance; reliability constraints; focal transformations; perturbations; communication cost; packet delay; directed graph; packet switched network
Citation:
S. Pierre, A. Elgibaoui, "Improving communication network topologies using tabu search," lcn, pp.44, 22nd Annual IEEE International Conference on Local Computer Networks (LCN'97), 1997
Usage of this product signifies your acceptance of the Terms of Use.