贪婪算法是一种动态组播路由算法，该算法获得的通信树时延较大。

Greedy algorithm achieves low cost multicast tree whose delay performance is worse than other trees.

youdao

这一方法不仅利用二项树通信步中的规则性，而且利用了二项树拓扑结构的规则性。

The method exploits regularities both in the communication phases and in the topological communication structure of a binomial tree.

youdao

在网络通信模型的基础上，进一步结合蠕虫传播的特征，本文提出了蠕虫的攻击树模型。

Based on the network communication model and the characters of the worm's propagation, this article gives the attack-tree model of worm.

youdao