TY - GEN
T1 - Fuzzy simulated evolution algorithm for topology design of campus networks
AU - Youssef, Habib
AU - Sait, Sadiq M.
AU - Khan, Salman A.
PY - 2000
Y1 - 2000
N2 - The topology design of campus networks is a hard constrained combinatorial optimization problem. It consists of deciding the number, type, and location of the active network elements (nodes) and links. This choice is dictated by physical and technological constraints and must optimize several objectives. Example of objectives are monetary cost, network delay, and hop count between communicating pairs. Furthermore, due to the nondeterministic nature of network traffic and other design parameters, the objective criteria are imprecise. Fuzzy logic provides a suitable mathematical framework in such a situation. We present an approach based on the simulated evolution algorithm for the design of campus network topology. The two main phases of the algorithm, namely, evaluation and allocation, have been fuzzified. To diversify the search, we have also incorporated tabu search-based characteristics in the allocation phase of the SE algorithm. This approach is then compared with the simulated annealing algorithm, which is another well-known heuristic. Results show that on all test cases the simulated evolution algorithm exhibits more intelligent search of the solution subspace and was able to find better solutions than simulated annealing.
AB - The topology design of campus networks is a hard constrained combinatorial optimization problem. It consists of deciding the number, type, and location of the active network elements (nodes) and links. This choice is dictated by physical and technological constraints and must optimize several objectives. Example of objectives are monetary cost, network delay, and hop count between communicating pairs. Furthermore, due to the nondeterministic nature of network traffic and other design parameters, the objective criteria are imprecise. Fuzzy logic provides a suitable mathematical framework in such a situation. We present an approach based on the simulated evolution algorithm for the design of campus network topology. The two main phases of the algorithm, namely, evaluation and allocation, have been fuzzified. To diversify the search, we have also incorporated tabu search-based characteristics in the allocation phase of the SE algorithm. This approach is then compared with the simulated annealing algorithm, which is another well-known heuristic. Results show that on all test cases the simulated evolution algorithm exhibits more intelligent search of the solution subspace and was able to find better solutions than simulated annealing.
UR - https://www.scopus.com/pages/publications/0033670637
U2 - 10.1109/CEC.2000.870293
DO - 10.1109/CEC.2000.870293
M3 - Conference contribution
AN - SCOPUS:0033670637
SN - 0780363752
SN - 9780780363755
T3 - Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000
SP - 180
EP - 187
BT - Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000
PB - IEEE Computer Society
ER -