In some environments there might be a need to configure multiple, separate domains within a single network. This requirement leads to segment the entire LAN Emulation network to several subnetworks, 'emulated LANs(ELANs). Broadcast traffic is bounded within ELANs, but there are no rules on segmenting ELANs. This thesis is concerned with the schemes on optimal configuration of LAN Emulation Network, especially for managing the broadcast traffic. The distribution of broadcast traffic in the entire network is changed with the configuration of ELANs. And there can be some blocked broadcast traffic based upon how ELANs are segmented. These blocked broadcast traffic means the defect in the provision of QoS to the users. On this thesis, the model which is to minimize the volume of blocked broadcast traffic with the constraints from the restricted resources of LANE network hardwares is introduced. This problem can be regarded as a special case of graph partitioning problems. Even though the graph partitioning problems are studied for a long time, the characteristic of this problem, the undecided sizes of segments, makes it hard to solve this problem. The algorithm to solve this problem model is implemented from the idea of genetic algorithm. And a sample network is reconfigured based upon this algorithm. Some implications are founded from the results of this experiment. And this leads to the way of further works for more realistic models.
