Weighted Cache Location Problem with Identical Servers

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of Applied Mathematics Ročník 2014; číslo 2014; s. 421 - 431-545
Hlavní autoři: Wang, Hongfa, Ding, Wei
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cairo, Egypt Hindawi Limiteds 01.01.2014
Hindawi Publishing Corporation
John Wiley & Sons, Inc
Wiley
Témata:
Algorithms
Dynamic programming
Equivalence
Heuristic
Networks
Production scheduling
Running
Series (mathematics)
Servers
Servers (computers)
Trees
ISSN:1110-757X, 1687-0042
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 ( p h 2 + n ) -time parallel exact algorithm for p -CLP on a tree and then present a parallel exact algorithm with at most O ( ( 4 / 9 ) p 2 n 2 ) 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1110-757X
1687-0042
DOI:10.1155/2014/586146