High-Density Model for Server Allocation and Placement (2002)
Cached
Download Links
- [parapet.ee.princeton.edu]
- [netlab.caltech.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | in Proc. of ACM SIGMETRICS ’02 |
| Citations: | 6 - 0 self |
BibTeX
@INPROCEEDINGS{Cameron02high-densitymodel,
author = {Craig W. Cameron and Steven H. Low and David X. Wei},
title = {High-Density Model for Server Allocation and Placement},
booktitle = {in Proc. of ACM SIGMETRICS ’02},
year = {2002},
pages = {152--159}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server allocation and placement algorithm based on high-rate vector quantization theory. The key idea is to regard the location of a request as a random variable with probability density that is proportional to the demand at that location, and the problem of server placement as source coding, i.e., to optimally map a source value (request location) to a codeword (server location) to minimize distortion (network cost). This view has led to a joint server allocation and placement algorithm that has a time-complexity that is linear in the number of clients. Simulations are presented to illustrate its performance.
