【摘要】 提出了一种基于拉格朗日松弛方法的时延约束最小代价多播路由算法(LR-DLMA)。该算法充分利用拉格朗日松弛方法的特点,通过构建封闭图,对封闭图进行拉格朗日松弛求得满足条件的多播树。仿真实验结果表明本算法性能稳定,其代价性能接近性能最好的BSMA算法,并具有快速、低时延的特点。更多还原

【Abstract】 An novel algorithm based Lagrange relaxation for delay-constrained least-cost multicast routing (LR-DLMA) is proposed to solve delay-constrained multicast routing problem. The algorithm makes use of the characteristic of Lagrange relaxation method, and finds multicast tree satisfying constraint by constructing closure graph and making relaxation to this graph. A large number of simulations demonstrate that performance of the algorithm is steady, and its cost performance is close to BSMA algorithm whose performance is best. At last, the algorithm has characteristics of quickness and lower delay.更多还原