IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v22y2011i4d10.1007_s10878-010-9312-z.html
   My bibliography  Save this article

Optimal tree structure with loyal users and batch updates

Author

Listed:
  • Yu-Ki Chan

    (City University of Hong Kong)

  • Minming Li

    (City University of Hong Kong)

  • Weiwei Wu

    (City University of Hong Kong
    University of Science and Technology of China
    USTC-CityU Joint Research Institute)

Abstract

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, we try to bound the size of the subtree rooted at every non-root node. Based on the size bound, we construct the optimal tree using dynamic programming algorithm in O(n⋅K+K 4) time where K=min {4(log (1−p)−1)−1,n} and n is the number of normal users.

Suggested Citation

  • Yu-Ki Chan & Minming Li & Weiwei Wu, 2011. "Optimal tree structure with loyal users and batch updates," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 630-639, November.
  • Handle: RePEc:spr:jcomop:v:22:y:2011:i:4:d:10.1007_s10878-010-9312-z
    DOI: 10.1007/s10878-010-9312-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9312-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-010-9312-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:22:y:2011:i:4:d:10.1007_s10878-010-9312-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.