A spanning tree-based genetic algorithm for bicriteria topological network design

The optimization problems for the communication network have been taken attentions by many related researchers, such as network designers, network analysts, network administrators. And the use of computer communication networks has been rapidly increasing in order to share expensive hardware/software resources and provide access to main system from distant locations. These network problems have many applications in telecommunications, computer networking, and the related domains in electric, gas, and sewer networks. Especially, in the computer networking, LANs are commonly used as the communication infrastructure that meets the demands of the users in local environment. These networks typically consist of several LAN segments connected together via bridges. The use of these transparent bridges requires loop-free paths between LAN segments. Therefore, only spanning tree topologies can be used as active LAN configurations. Recently, genetic algorithms have got a great advancement in related research fields, such as network optimization problem, combinatorial optimization, multiobjective optimization, and so on. Also genetic algorithm have received a great deal of attention about its ability as optimization techniques for many real-world problem. In this paper, we attempt to the topology design problem in LAN with bicriteria which is minimizing the cost and average message delay using spanning tree-based genetic algorithm, because the interconnection between the network service centers must yield spanning tree configurations. Finally, we get some experiments in order to certify the quality of the networks designs obtained by using spanning tree-based genetic algorithm