Dynamic and static algorithms for optimal placement of resources in a tree
Theoretical Computer Science
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Adaptive web caching: towards a new global caching architecture
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
Web caching with consistent hashing
WWW '99 Proceedings of the eighth international conference on World Wide Web
RaDaR: a scalable architecture for a global Web hosting service
WWW '99 Proceedings of the eighth international conference on World Wide Web
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
On network-aware clustering of Web clients
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
IEEE/ACM Transactions on Networking (TON)
Source Coding Theory
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
IEEE Journal on Selected Areas in Communications
Hash routing for collections of shared Web caches
IEEE Network: The Magazine of Global Internetworking
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
On content delivery network implementation
Computer Communications
On using Content Delivery Networks to improve MOG performance
International Journal of Advanced Media and Communication
Optimizing server placement in distributed systems in the presence of competition
Journal of Parallel and Distributed Computing
Optimal placement of anchor points within large telecommunication networks
WWIC'06 Proceedings of the 4th international conference on Wired/Wireless Internet Communications
A suitable server placement for peer-to-peer live streaming
The Journal of Supercomputing
| Hi-index | 0.02 |
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 code-word (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.