Optimal tree structure with loyal users and batch updates

@article{Chan2011OptimalTS,
  title={Optimal tree structure with loyal users and batch updates},
  author={Yu-Ki Chan and Minming Li and Weiwei Wu},
  journal={Journal of Combinatorial Optimization},
  year={2011},
  volume={22},
  pages={630-639}
}
We study the probabilistic model in the key tree management problem. Users have different behaviors. Normal users have probability p to issue join/leave request while the loyal users have probability zero. Given the numbers of such users, our objective is to construct a key tree with minimum expected updating cost. We observe that a single LUN (Loyal User Node) is enough to represent all loyal users. When 1−p≤0.57 we prove that the optimal tree that minimizes the cost is a star. When 1−p>0.57… CONTINUE READING

Citations

Publications citing this paper.

Optimal key tree structure for two-user replacement and deletion problems

  • J. Comb. Optim.
  • 2013
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Similar Papers

Loading similar papers…