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...
| Những tác giả chính: | , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
Hindawi Limited
2014-01-01
|
| Loạt: | Journal of Applied Mathematics |
| Truy cập trực tuyến: | http://dx.doi.org/10.1155/2014/586146 |