Craig W. Cameron
ABSTRACT
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.
- Vincenzo Auletta, Domenica Parente, and Giuseppe Persiano. Dynamic and static algorithms for optimal placement of resources in a tree. Theoretical Computer Science, 165:441-461, 1996. Google Scholar
Digital Library
- Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. 37th IEEE Symp. on Foundation of Computer Science, pages 184-193, 1996. Google ScholarDigital Library
- S. Bhattacharjee, K. Calvert, and E. W. Zegura. Self-organizing wide-area network caches. In Proceedings of IEEE Infocom, March/April 1998.Google ScholarCross Ref
- C. M. Bowman, P. B. Danzig, D. R. Hardy, U. Manber, and M. F. Schwartz. The Harvest information discovery and access system. In Proc. of the Second International Conf. on the World Wide Web, pages 763-771, 1994.Google Scholar
- Lee Breslau, Pei Cao, Li Fan, Graham Phillips, and Scott Shenker. Web caching and Zipf-like distributions: Evidence and implications. In Proceedings of the IEEE Infocom, March 1999.Google ScholarCross Ref
- Anawat Chankhunthod, Michael Schwartz, Peter Danzig, Kurt Worrell, and Chuck Neerdaels. A hierarchical internet object cache. In Proceedings of the 1996 Usenix Technical Conference, pages 153-163, 1996. Google ScholarDigital Library
- M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median. In Proc. 30th ACM Symp on Theory of Computing, pages 114-123, 1998. Google ScholarDigital Library
- M. Charikar, S. Guha, E. Tardos, and D. Shmoys. A constant-factor approximation algorithm for the k-median problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 1-10, May 1999. Google ScholarDigital Library
- Moses Charikar and Sudipto Guha. Improved combinatorial algorithms for the facility location and k-median problems. In IEEE Symposium on Foundations of Computer Science, pages 378-388, 1999. Google ScholarDigital Library
- L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary Cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Trans. on Networking, 8(3):281-293, June 2000. Google ScholarDigital Library
- Robert M. Gray. Source coding theory. Kluwer Academic Publishers, 1990. Google ScholarDigital Library
- Kamal Jain and Vijay V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. to appear in J. ACM, 2001. Google ScholarDigital Library
- J. Kangasharju, K. W. Ross, and J. W. Roberts. Locating copies of objects using the domain name system. In Proceedings of the 4th International Caching Workshop, March 1999.Google Scholar
- D. Karger, T. Leighton, D. Lewin, and A. Sherman. Web caching with consistent hasing. In Proc. of the 8th Int World Wide Web Conf., May 1999. Google ScholarDigital Library
- O. Kariv and S. L. Hakimi. An algorithmic approach to network location problems. II: the p-medians. SIAM J. Appl. Math., 37(3):539-560, December 1979.Google ScholarCross Ref
- Balachander Krishnamurthy and Jia Wang. On network-aware clustering of web clients. In Proceedings of ACM SIGCOMM 2000, August 2000. Google ScholarDigital Library
- P. Krishnan, D. Raz, and Y. Shavitt. The cache location problem. IEEE/ACM Trans. on Networking, 8(5):568-582, October 2000. Google ScholarDigital Library
- Bo Li, Mordecai Golin, Giuseppe Italiano, Xin Deng, and Kazem Sohraby. On the optimal placement of web proxies in the internet. In Proceedings of IEEE Infocom, March 1999. Google ScholarDigital Library
- B. S. Michel, K. Nikoloudakis, P. Reiher, and L. Zhang. URL forwarding and compression in adaptive web caching. In Proc. of IEEE Infocom, volume 2, pages 670-678, March 2000.Google ScholarCross Ref
- Scott Michel, Khoi Nguyen, Adam Rosenstein, Lixia Zhang, Sally Floyd, and Van Jacobson. Adaptive Web caching: towards a new global caching architecture. Computer Networks and ISDN Systems, 30(22-23):2169-2177, 1998. Google ScholarDigital Library
- C. Papadimitriou. Worst-case and probabilistic analysis of a geometric location problem. SIAM J. Comput., 10:542-557, 1981.Google ScholarDigital Library
- L Qiu, V. Padmanabhan, and G. Voelker. On the placement of web server replicas. In Proceedings of IEEE Infocom, April 2001.Google Scholar
- M. Rabinovich and A. Aggarwal. RaDaR: A scalable architecture for a global web hosting service. In Proceedings of the 8th Int. World Wide Web Conf., May 1999. Google ScholarDigital Library
- K. W. Ross. Hash-routing for collections of shared web caches. IEEE Network Magazine, pages 37-45, November/December 1997. Google ScholarDigital Library
- A. Shaikh, R. Tewari, and M. Agrawal. On the effectiveness of DNS-based server selection. In Proceedings of IEEE Infocom, April 2001.Google ScholarCross Ref
- A. Tamir. An O(pn2) algorithm for the p-median and related problems on tree graphs. Oper. Res. Lett., 19:59-64, 1996. Google ScholarDigital Library
- J. Touch. The LSAM proxy cache - a multicast distributed virtual caceh. In Proc. of the 3rd Int. WWW Caching Workshop, June 1998.Google Scholar
- Duane Wessels and K. Claffy. Icp and the squid web cache. IEEE Journal on Selected Areas in Communication, 16(3):345-357, April 1998. Google ScholarDigital Library
Index Terms
- High-density model for server allocation and placement
Recommendations
High-density model for server allocation and placement
Measurement and modeling of computer systemsIt 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 ...
A paracasting model for concurrent access to replicated Internet content
In this paper, we develop a model to study how to effectively download a document from a set of replicated servers. We propose a generalized application-layer anycasting protocol, known as paracasting, to advocate concurrent access of a subset of ...
Comments