但是如果在不稳定树中发现了页面，则合并该页面，然后将该节点迁移到稳定树中。
But if the page is found in the unstable tree, you merge the pages, and then migrate the node to the stable tree.
第一，如果搜索代码没有在不稳定树中发现页面，则在不稳定树中为该页面添加一个新节点。
First, if the search does not find the page in the unstable tree, you add a new node in the unstable tree for this page.
本文建立了应用层组播节点的欺骗模型，并讨论了在固定组成员的情况下，节点欺骗引起的组播树不稳定问题。
This paper establishes the cheating model of ALM nodes, and discusses the instability problem of ALM tree on the occurrence of node cheating when there is no multicast member changing.
应用推荐