Comparison of Heuristic Methods Applied to Optimization of Computer Networks

The paper concerns the minimization of the average delay of packets in the computer network. The formulated problem is NP complete. The authors proposed a solution that may be reachable in satisfying time using heuristic methods. Authors take into consideration the proposed algorithms which are based on ideas such as simulated annealing, taboo search and genetic approach. In order to compare performance of these methods the experimentation system has been made. This system was implemented in C++ and Borland builder 6.0 programming environment. The created application allows to make investigations along with the complex experiments showing the current state of network and the obtained results in convenient way by utilizing visualization module and presentation module. The results of example research are shown and discussed.