A Caltech Library Service

High-density model of content distribution network

Cameron, Craig and Low, Steven H. and Wei, David X. (2002) High-density model of content distribution network. In: Information, Decision and Control, 2002. Final Program and Abstracts. IEEE , Piscataway, NJ, p. 26. ISBN 0-7803-7270-0.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Low, Steven H.0000-0001-6476-3048
Additional Information:© 2002 IEEE.
Record Number:CaltechAUTHORS:20170810-102351659
Persistent URL:
Official Citation:C. Cameron, S. H. Low and D. Wei, "High-density model of content distribution network," Final Program and Abstracts on Information, Decision and Control, Adelaide, SA, Australia, 2002, pp. 129-134. doi: 10.1109/IDC.2002.995378 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:80079
Deposited By: Pengcheng You
Deposited On:10 Aug 2017 17:36
Last Modified:15 Nov 2021 17:52

Repository Staff Only: item control page