Cache location in tree networks: Preliminary results

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationNetwork Optimization - 5th International Conference, INOC 2011, Proceedings
Pages517-522
Number of pages6
DOIs
Publication statusPublished - 26 Sept 2011
Event5th International Conference on Network Optimization, INOC 2011 - Hamburg, Germany
Duration: 13 Jun 201116 Jun 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6701 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Network Optimization, INOC 2011
Country/TerritoryGermany
CityHamburg
Period13/06/1116/06/11

Fingerprint

Dive into the research topics of 'Cache location in tree networks: Preliminary results'. Together they form a unique fingerprint.

Cite this