ISSN:
1614-7456
Keywords:
Network design
;
Message delay
;
Spanning tree-based genetic algorithm
;
Local area networks (LANs)
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract The optimization problems in communication networks have received the attention of many researchers in such related fields as network designer, network analysis, and network administration. The use of computer communication networks has been increasing rapidly in order to share expensive hardware/software resources and provide access to main systems from distant locations. These network problems have many applications in telecommunications, computer networking, and related domains in electric, gas, and sewer networks. In computer networking, LANs (local area networks) are commonly used as the communication infrastructure that meets the demands of users in the 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 greatly advanced in related research fields such as network optimization problems, combinatorial optimization, multiobjective optimization, and so on. Genetic algorithms have also received a great deal of attention because of their ability as optimization techniques for many real-world problems. In this paper, we attempt to solve the LAN topology design problem with bicriteria which minimize the cost and average message delay using genetic algorithms, and propose a method of searching the Pareto solutions. We also employ the Prüfer number in order to represent the chromosomes, because the interconnection between the network service centers must yield spanning tree configurations. Finally, we conduct experiments to certify the quality of the networks designs obtained by using genetic algorithms.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02481249
Permalink
