Proxy location problems and their generalizations

Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003

Volumn , Issue , 2003, Pages 898-904

  Choi, Sumi ^a   Shavitt, Y ^b  

^a WASHINGTON UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Authentication; Computer science; Costs; Network servers; Network topology; Peer to peer computing; Telecommunication traffic; Traffic control; Web server

Indexed keywords

APPROXIMATION ALGORITHMS; AUTHENTICATION; COMPUTER SCIENCE; COSTS; ELECTRIC NETWORK TOPOLOGY; LOCATION; OPTIMIZATION; PEER TO PEER NETWORKS; SERVERS; SITE SELECTION; TELECOMMUNICATION TRAFFIC; TOPOLOGY; TRAFFIC CONTROL;

DIFFERENT SERVICES; LOCATION PROBLEMS; NETWORK SERVER; NETWORK TOPOLOGY; OPTIMAL SOLUTIONS; PEER-TO-PEER COMPUTING; UNIFIED FRAMEWORK; WEB SERVERS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84943518525     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCSW.2003.1203665     Document Type: Conference Paper

References (20)

1. R. Albert and A.-L. Barabási. Topology of evolving networks: local events and universality. Physical Review Letters, 85(24):5234-5237, 11 Dec. 2000.
2. R. Albert, H. Jeong, and A.-L. Barabási. Diameter of the world wide web. Nature, 401:130-131, 1999.
3. S. Arora, P. Raghavan, and S. Rao. Approximations schemes for euclidean k-medians and related problems. In STOC'98, pages 106-113, Dallas, TX, USA, 1998.
4. L. Breslau, P. Cao, L. Fan, G. Philips, and S.Shenker. Web caching and zipf-like distributions: evidence and implications. In INFOCOM'99, New York, NY, USA, Mar. 1999.
5. Y. Chen, R. H. Katz, and J. D. Kubatowicz. Dynamic replica placement for scalable content delivery. In First International Workshop on Peer-to-Peer Systems (IPTPS 2002), Mar. 2002.
6. S. Choi and Y. Shavitt. Placing servers for session-oriented services. Technical Report WUCS-01-41, Washington University at St. Louis, Dept. of Computer Science, 2001.
7. F. Chudak. Improved approximation algorithms for uncapacitated facility location. In IPCO: 6th Integer Programming and Combinatorial Optimization Conference, 1998.
8. I. Cidon, S. Kutten, and R. Soffer. Optimal allocation of electronic content. Computer Networks, 40(2):205-218, Oct. 2002.
9. E. Cronin, S. Jamin, C. Jin, A. Kurc, D. Raz, and Y. Shavitt. Constrained mirror placement on the Internet. IEEE Journal on Selected Areas in Communications, 20(7):1369-1382, Sept. 2002.
10. D. Hochbaum. Approximation algorithms for combinatorial problems. Mathematical Programming, 22:148-162, 1982.
11. D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
12. J. Kangasharju, J. Roberts, and K. W. Ross. Object replication strategies in content distribution networks. In The 6th International Web Caching Workshop and Content Delivery Workshop, Boston, MA, USA, June 2001.
13. P. Krishnan, D. Raz, and Y. Shavitt. The cache location problem. IEEE/ACM Transactions on Networking, 8(5):568-582, Oct. 2000.
14. B. Li, M. J. Golin, G. F. Italiano, X. Deng, and K. Sohraby. On the optimal placement of web proxies in the internet. In IEEE INFOCOM'99, pages 1282-1290, Mar. 1999.
15. J.-H. Lin and J. S. Vitter. Approximation algorithms for geometric median problems. Information processing Letters, 44:245-249, 1992.
16. J.-H. Lin and J. S. Vitter. ε-approximations with minimum packing constraint violation. In STOC'92, Victoria, B.C., Canada, 1992.
17. S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson. The end-to-end effects of internet path selection. In ACM SIGCOMM'99, Boston, MA, USA, Aug./Sept. 1999.
18. J. M. Smith, K. L. Calvert, S. L. Murphy, H. K. Orman, and L. L. Peterson. Activating networks: A progress report. IEEE Computer, 32(4):32-41, Apr. 1999.
19. B. C. Tansel, R. L. Francis, and T. J. Lowe. Location on networks: a survey. part I: The p-center and p-median problems. Management Science, 29(4):482-497, Apr. 1983.
20. V. Vazirani. Approximation Methods. Springer-Verlag, 2001.