KPP的翻译

Experiment results showed that, compared with KPP, multicast trees generated by SBMR were 72% better than that generated by KPP with 13% decrease of cost, and 9% less links invoked.

实验结果表明，与多播路由KPP算法相比，本算法构建的多播树有72%比KPP算法构建的多播树更优，代价降低13%，启用的链路数减少9%，而且CPU时间减少15%。

The simulation results show that this algorithm can not only construct delay-constrained multicast tree correctly, but also has a less cost and a lower computational complexity than KPP.

仿真结果表明，该算法能正确地构造出时延约束组播树，同时还具有较低的代价和计算复杂度。

Compared with KPP, this algorithm can construct a multicast tree with lower time complexity, thus can be used for large network to confirm multicast routing conveniently.

与KPP算法相比，DMR算法能够以较低的时间复杂度来构建多播树，从而可以较好地用于求解大型网络的多播路由问题。