High-density model of content distribution network
- Creators
- Cameron, Craig
- Low, Steven H.
- Wei, David X.
Abstract
It is well known that optimal server placement is NP-hard. We present an approximate model of a content distribution network for the case when both clients and servers are dense, and propose a simple server allocation and placement algorithm based on high-rate 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 leads to a joint server allocation and placement algorithm that has a time-complexity that is linear in the number of users.
Additional Information
© 2002 IEEE.
Attached Files
Published - 00995378.pdf
Files
Name | Size | Download all |
---|---|---|
md5:97e00879ef6e2aab4e3b0d525fe4b01c
|
84.4 kB | Preview Download |
Additional details
- Eprint ID
- 80079
- DOI
- 10.1109/IDC.2002.995378
- Resolver ID
- CaltechAUTHORS:20170810-102351659
- Created
-
2017-08-10Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field