IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2014y2014i1n586146.html

Weighted Cache Location Problem with Identical Servers

Author

Listed:
  • Hongfa Wang
  • Wei Ding

Abstract

This paper extends the well‐known p‐CLP with one server to p‐CLP with m ≥ 2 identical servers, denoted by (p, m)‐CLP. We propose the closest server orienting protocol (CSOP), under which every client connects to the closest server to itself via a shortest route on given network. We abbreviate (p, m)‐CLP under CSOP to (p, m)‐CSOP CLP and investigate that (p, m)‐CSOP CLP on a general network is equivalent to that on a forest and further to multiple CLPs on trees. The case of m = 2 is the focus of this paper. We first devise an improved O(ph2 + n)‐time parallel exact algorithm for p‐CLP on a tree and then present a parallel exact algorithm with at most O((4/9)p2n2) time in the worst case for (p, 2)‐CSOP CLP on a general network. Furthermore, we extend the idea of parallel algorithm to the cases of m > 2 to obtain a worst‐case O((4/9)(n − m) 2((m + p) p/(p − 1)!))‐time exact algorithm. At the end of the paper, we first give an example to illustrate our algorithms and then make a series of numerical experiments to compare the running times of our algorithms.

Suggested Citation

  • Hongfa Wang & Wei Ding, 2014. "Weighted Cache Location Problem with Identical Servers," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    • Handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:586146
    DOI: 10.1155/2014/586146
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/586146
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/586146?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
    ---><---

    References listed on IDEAS

    as
    1. Wei Ding & Yu Zhou & Guangting Chen & Hongfa Wang & Guangming Wang, 2013. "On the 2-MRS Problem in a Tree with Unreliable Edges," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-11, November.
    2. Guangting Chen & Gu Zhang & Rainer E. Burkard, 2006. "The web proxy location problem in general tree of rings networks," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 327-336, December.
    3. Wei Ding & Yu Zhou & Guangting Chen & Hongfa Wang & Guangming Wang, 2013. "On the 2‐MRS Problem in a Tree with Unreliable Edges," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Abdallah W. Aboutahoun & Eman Fares, 2019. "On the Location of a Constrained k−Tree Facility in a Tree Network with Unreliable Edges," Journal of Applied Mathematics, John Wiley & Sons, vol. 2019(1).
    2. Wei Ding & Ke Qiu, 2018. "A quadratic time exact algorithm for continuous connected 2-facility location problem in trees," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1262-1298, November.

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnljam:v:2014:y:2014:i:1:n:586146. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.