The web proxy location problem in general tree of rings networks

The web proxy location problem in general tree of rings networks

0.00 Avg rating0 Votes
Article ID: iaor20071625
Country: Netherlands
Volume: 12
Issue: 4
Start Page Number: 327
End Page Number: 336
Publication Date: Dec 2006
Journal: Journal of Combinatorial Optimization
Authors: , ,
Keywords: communication, internet
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(kn2) time complexity.

Reviews

Required fields are marked *. Your email address will not be published.