As shown in Tab. 1, there are generally enough stable nodesin each time instance for building a treebone. In fact, even asmall set of stable nodes is sufficient to support the wholeoverlay. As an illustration, consider a simple K-ary tree ofheight H. The fraction of its internal nodes, i.e., those belongto the backbone, is no more than 1/K if the tree is completeand balanced (∑H i=0 −2 Ki/ ∑H i=0 −1 Ki < K 1 ).
đang được dịch, vui lòng đợi..
![](//viimg.ilovetranslation.com/pic/loading_3.gif?v=b9814dd30c1d7c59_8619)