Abstract
The Web proxy location problem in general networks is an NP-hard problem. In this paper, we study the problem in networks showing a general tree of rings topology. We improve the results of the tree case in literature and get an exact algorithm with time complexity O(nhk), where n is the number of nodes in the tree, h is the height of the tree (the server is in the root of the tree), and k is the number of web proxies to be placed in the net. For the case of networks with a general tree of rings topology we present an exact algorithm with O(kn 2) time complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arlitt MF, Williamson CL (1997) Internet web servers: workload characterization and performance implications. IEEE Trans Network 5:631–645
Baentsch M, Baum L, Molters G, Rothkugel S, Sturm P (1997) World wide web caching: the application-level view of the internet. IEEE Commun Mag 35:170–178
Bestavros A (1997) WWW traffic reduction and load balancing through server-based caching. IEEE Concur 5:56–67
Burkard RE, Krarup J (1998) A linear algorithm for the pos/neg weighted 1-median problem on a cactus. Computing 60:193–215
Chen G, Li G, Xue G (2000) Optimal placement of wavelength converters in WDM optical networks with a general tree of rings topology. In: Proc. of international conference on computer communications and networks
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. W. H. Freeman and Company, San Francisco
Glassman S (1994) A caching relay for world wide web. Compu Network ISDN Syst 27:165–173
Krishnan P, Raz D, Shavitt Y (2000) The cache location problem. IEEE/ACM Trans Network 8:568–582
Li B, Deng X, Golin M, Sohraby K (1998) On the optimal placement of web proxies in the internet: linear topology. In: Proceedings of the 8th IFIP conference on high performance networking, Vienna
Li B, Golin M, Italiano G, Deng X, Sohraby K (1999) On the optimal placement of web proxies in the internet. In: Proceedings of the IEEE infocom conference, pp 1282–1290
Tamir A (2001) An O(pn 2) algorithm for the p-median and related problems on tree graphs. Oper Res Lett 19:59–64
Woeginger GJ (2000) Monge strikes again: optimal placement of web proxies in the internet. Oper Res Lett 27:93–96
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been supported by NSF of China (No. 10371028) and the Educational Department grant of Zhejiang Province (No. 20030622).
Rights and permissions
About this article
Cite this article
Chen, G., Zhang, G. & Burkard, R.E. The web proxy location problem in general tree of rings networks. J Comb Optim 12, 327–336 (2006). https://doi.org/10.1007/s10878-006-9002-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-9002-z