Optimal methods for object management in coordinated en-route web caching for tree networks and autonomous systems
by Keqiu Li, Hong Shen
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 3, No. 4, 2005

Abstract: This paper first addresses the problem of computing the optimal locations for placing copies of an object among the enroute caches in coordinated enroute web caching for tree networks, such that the overall cost gain is maximised. We formulate this problem as an optimisation problem and consider both unconstrained and constrained cases. The constrained case includes constraints on the cost gain per node and on the number of copies to be placed. We also derive low cost, dynamic programming based algorithms that provide optimal solutions for these cases. To the best of our knowledge, these problems have not been studied previously. Second, we present a solution for coordinated enroute web caching for autonomous systems, based on the solution for coordinated enroute web caching for tree networks. Finally, we implement the algorithms and compare our methods with existing ones. The simulation results show that our methods outperform existing algorithms for both coordinated enroute web caching for linear topology and object placement at individual nodes.

Online publication date: Fri, 30-Dec-2005

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com