Weighted Cache Location Problem with Identical Servers

Hongfa Wang and Wei Ding

Journal of Applied Mathematics, 2014, vol. 2014, 1-11

Abstract:

This paper extends the well-known -CLP with one server to -CLP with identical servers, denoted by -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 -CLP under CSOP to -CSOP CLP and investigate that -CSOP CLP on a general network is equivalent to that on a forest and further to multiple CLPs on trees. The case of is the focus of this paper. We first devise an improved -time parallel exact algorithm for -CLP on a tree and then present a parallel exact algorithm with at most time in the worst case for -CSOP CLP on a general network. Furthermore, we extend the idea of parallel algorithm to the cases of to obtain a worst-case -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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2014/586146.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2014/586146.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:586146

DOI: 10.1155/2014/586146

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().