The traditional Aggregated Multicast was divided the problem into three sub-problems, namely, candidate tree generation, tree selection and group-to-tree mapping.
传统的聚合组播包括三个主要步骤，分别是候选树生成，树选择和组树匹配。
If the checksum has not changed, the unstable tree is searched for the candidate page.
如果校验和没有更改，则会搜索不稳定树以寻找候选页面。
If the candidate page is found in the stable tree, then it is merged and the candidate page freed.
如果候选页面位于稳定树中，则该页面被合并，候选页面被释放。
应用推荐