Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 2002 | Published
Book Section - Chapter Open

A server allocation and placement algorithm for content distribution


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.

Additional Information

© 2002 IEEE. This work was supported by Caltech Lee Center for Advanced Networking and Yuen Research Fund.

Attached Files

Published - 01115407.pdf


Files (234.4 kB)
Name Size Download all
234.4 kB Preview Download

Additional details

August 19, 2023
October 25, 2023