【摘要】 提出了一种使用禁忌搜索方法构造组播树的时延约束最小代价组播路由算法(TSBDMA)。该算法充分利用禁忌搜索方法中灵活的记忆功能和禁忌规则等特点,以最小时延树为初始解,并使用换边操作构造邻域集,最终求得满足条件的组播树。仿真实验结果表明本算法具有代价性能良好、可靠性高、收敛速度快、时延低的特点。更多还原

【Abstract】 A novel algorithm based on tabu search for delay-constrained least-cost multicast routing (TSBDMA) is proposed to solve delay-constrained multicast routing problem. This algorithm makes use of the characteristics of flexible memory function and tabu rule in TS algorithm, starts with an initial least delay tree, generates neighborhood structure based on "exchange edge" operations, and finds multicast tree satisfying constraint. A large number of simulations demonstrate that the algorithm has characteristics of nice cost performance, high reliability, fast convergence speed and low delay.更多还原