The optimization problems for the communication network have beentaken attentions by many related researchers, such as network designers,network analysts, network administrators. And the use of computercommunication networks has been rapidly increasing in order to shareexpensive hardware/software resources and provide access to main systemfrom distant locations. These network problems have many applications intelecommunications, computer networking, and the related domains inelectric, gas, and sewer networks. Especially, in the computernetworking, LANs are commonly used as the communication infrastructurethat meets the demands of the users in local environment. These networkstypically consist of several LAN segments connected together viabridges. The use of these transparent bridges requires loop-free pathsbetween LAN segments. Therefore, only spanning tree topologies can beused as active LAN configurations. Recently, genetic algorithms have gota great advancement in related research fields, such as networkoptimization problem, combinatorial optimization, multiobjectiveoptimization, and so on. Also genetic algorithm have received a greatdeal of attention about its ability as optimization techniques for manyreal-world problem. In this paper, we attempt to the topology designproblem in LAN with bicriteria which is minimizing the cost and averagemessage delay using spanning tree-based genetic algorithm, because theinterconnection between the network service centers must yield spanningtree configurations. Finally, we get some experiments in order tocertify the quality of the networks designs obtained by using spanningtree-based genetic algorithm
展开▼
