论文部分内容阅读
研究了计算机局域网优化设计问题的数学模型。采用稀疏哈夫曼树来描述网络拓扑结构,并将遗传算法和模拟退火法相结合,提出了一种启发式搜索算法,实现了以最小平均时延为目标的局域网拓扑优化设计。实验结果表明启发式算法具有较好的性能。
The mathematic model of computer local area network optimization design problem is studied. A sparse Huffman tree is used to describe the topology of the network. A genetic algorithm and a simulated annealing method are combined to propose a heuristic search algorithm, which realizes the LAN topology optimization with the goal of minimum average delay. Experimental results show that the heuristic algorithm has better performance.