High-density model for server allocation and placement

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. Categories and Subject Descriptors C.2.5 [Computer Systems Organization]: Computer-communication Networks--Local and Wide-Area Networks; C.4 [Computer Systems Organization]: Performance of System General Terms Perfo...

• Type: Journal
• Year: 2002
• Where: SIGMETRICS
• Authors: Craig W. Cameron, Steven H. Low, David X. Wei
• Keywords: Computer Systems Organization, Hardware, Server Allocation, Server Placement, SIGMETRICS 2002