One popular approach to overcome the expected congestions due to the spectacular development of various multimedia applications consists in installing transparent caches at strategically chosen places inside telecommunication networks. The problem of locating caches is a difficult optimization problem, closely related to the p-median problem. In the case where the network is a tree, some cache location problems have already been investigated. In this paper, we propose to refine these models by taking into account a dynamic effect due to cache replacement policies. In our model, only the most popular contents are stored in the caches. The hierarchical effect of several successive caches is also captured by the model. A Mixed Integer Programming model and a Dynamic Programming algorithm are proposed and compared on a preliminary set of numerical experiments. © 2011 Springer-Verlag.
CITATION STYLE
Pierre, B., Walid, B. A., & Eric, G. (2011). Cache location in tree networks: Preliminary results. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6701 LNCS, pp. 517–522). https://doi.org/10.1007/978-3-642-21527-8_56
Mendeley helps you to discover research relevant for your work.