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 (p,m)-CLP...
| Published in: | Journal of Applied Mathematics |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Online Access: | http://dx.doi.org/10.1155/2014/586146 |