Rebuild Algorithm Clause Samples
Rebuild Algorithm. The motivation for the Rebuild algorithm is to minimize the final tree height so that the rekeying operations for each group member can be reduced. At the beginning of every rekey interval, we reconstruct the whole key tree with all existing members who remain in the group, together with the newly joining members. The resulting tree would be a complete tree. The pseudo-code of the Rebuild algorithm to be performed by every member is shown below:
1. obtain all members from and store them in ;
2. remove the leaving members in from ;
1. if ( ) /* pure join case */
2. create a new tree based on new members in ;
3. either (a) add to the shallowest node of (which need not be the leaf node) such that the merge would not in- crease the height of the result tree, or (b) add to the root node of if the merge to any node of would increase the tree height;
4. else /* L > 0 */
5. sort in an ascending order of the associated node IDs of the members and store the results in ;
6. if ( )
7. more members want to leave than join */ 8. if ( )
Rebuild Algorithm. The motivation of the Rebuild algorithm is to minimize the resulting tree height so that the rekeying operations for each group member can be reduced. At the beginning of every rekeying interval, we reconstruct the whole key tree with all existing members that remain in the communication group, together with the newly joining members. The resulting tree is a left-complete tree, in which the depths of the leaf nodes differ by at most one and those deeper leaf nodes are located at the leftmost positions. The pseudo-code of the Rebuild algorithm to be performed by every member is shown in Fig. 4. ▇▇▇▇▇▇▇ (T , M j , J , M l, L) 1. obtain all members from T and store them in M 0 ;
Rebuild Algorithm. The motivation for the Rebuild algorithm is to minimize the final tree height so that the rekeying operations for each group member can be reduced. At the beginning of every rekey interval, we reconstruct the whole key tree with all existing members who remain in the group, together with the newly joining members. The resulting tree would be a complete tree. The pseudo-code of the Rebuild algorithm to be performed by every member is shown below: ▇▇▇▇▇▇▇ (T , M j , J , M l, L) 1. obtain all members from T and store them in M 0 ; join */
Rebuild Algorithm. The motivation of the Rebuild algorithm is to minimize the resulting tree height so that the rekeying operations for each group member can be reduced. At the beginning of every rekeying interval, we reconstruct the whole key tree with all existing members that remain in the communication group, together with the newly joining members. The resulting tree is a left-complete tree, in which the depths of the leaf nodes differ by at most one and those deeper leaf nodes are located at the leftmost positions. The pseudo-code of the Rebuild algorithm to be performed by every member is shown in Fig. 4. following section, we describe the interval-based approach to manage the rekeying operations.