The web proxy location problem in general tree of rings networks
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.
KeywordsLocation problem Tree General tree of rings Proxy Placement
Unable to display preview. Download preview PDF.
- Bestavros A (1997) WWW traffic reduction and load balancing through server-based caching. IEEE Concur 5:56–67Google Scholar
- 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 networksGoogle Scholar
- Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. W. H. Freeman and Company, San FranciscoGoogle Scholar
- 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, ViennaGoogle Scholar
- 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–1290Google Scholar