Construction of Lyapunov functions via relative entropy with application to caching

Nicolas Gast 1, *
* Corresponding author
1 POLARIS - Performance analysis and optimization of LARge Infrastructures and Systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : We consider a system of interacting objects that is a generalization of the model of the cache-replacement policy RAND(m) policy introduced in [6]. We provide a mean-field approximation of this system. We show how to use relative entropy to construct a Lyapunov function for this model. This guarantees that the mean-field model converges to its unique fixed point.
Liste complète des métadonnées

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01321017
Contributor : Nicolas Gast <>
Submitted on : Thursday, June 30, 2016 - 10:57:26 AM
Last modification on : Thursday, October 11, 2018 - 8:48:05 AM

File

Gast_liapunovCache.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01321017, version 2

Citation

Nicolas Gast. Construction of Lyapunov functions via relative entropy with application to caching. The 18th Workshop on MAthematical performance Modeling and Analysis, Jun 2016, Nice, France. ⟨hal-01321017v2⟩

Share

Metrics

Record views

439

Files downloads

275