一种网络仿真实验床映射问题的启发式算法  

Heuristic Algorithm for Mapping Problem of Network Emulation Testbed

作　　者：刘轶[1] 肖凯平[1] 李艳萍[1] 

机构地区：[1]西安交通大学计算机科学与技术系,西安710049

出　　处：《西安交通大学学报》2006年第8期878-882,共5页Journal of Xi'an Jiaotong University

基　　金：国家高技术研究发展计划资助项目(2001AA112120)

摘　　要：提出了一种求解网络仿真实验床映射问题的启发式算法.该算法的思想是:为尽量少地占用仿真实验床的网络资源,应尽可能地将实验者要求的逻辑拓扑中连接紧密的结点映射到同一台交换机上.为此,将仿真实验床的物理拓扑以交换机为单位分成若干子图,之后在实验者要求的逻辑拓扑上进行迭代,每次迭代按边和权值选取结点进行子图划分,最终得到的划分图即为逻辑拓扑到仿真实验床物理拓扑的映射结果.实验结果表明,该算法能在较短的时间内求得近优解,并且当结点个数增大时,算法的求解时间远少于遗传算法.A heuristic algorithm for mapping problem of the network emulation testbed was presented. The idea of the algorithm is as follows. The tightly connected nodes of the graph of logictopology required by experimenter are mapped possibly to the same single switch in order to occupy as less network resources of emulation testbed as possible. Thereby, the physical topology of the emulation testbed is partitioned into several sub-graphs in a switch unit, and then the iteration is carried out on the logic-topology required by the experimenter, at each iteration the subgraphs is partitioned into the nodes selected by edge and weight value. The resulting partitioned graph corresponds to the mapping result which maps the logic-topology into the physical topology of the emulation testbed. Experiment result shows that the heuristic algorithm can find near-optimal solutions in shorter time, and the runtime is far less than genetic algorithm when increasing the number of nodes.

关 键 词：网络仿真 网络实验床 启发式算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]