A Refined Mean Field Approximation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Proceedings of the ACM on Measurement and Analysis of Computing Systems Année : 2017

A Refined Mean Field Approximation

Résumé

Mean field models are a popular means to approximate large and complex stochastic models that can be represented as N interacting objects. Recently it was shown that under very general conditions the steady-state expectation of any performance functional converges at rate O(1/N) to its mean field approximation. In this paper we establish a result that expresses the constant associated with this 1/N term. This constant can be computed easily as it is expressed in terms of the Jacobian and Hessian of the drift in the fixed point and the solution of a single Lyapunov equation. This allows us to propose a refined mean field approximation. By considering a variety of applications, that include coupon collector, load balancing and bin packing problems, we illustrate that the proposed refined mean field approximation is significantly more accurate that the classic mean field approximation for small and moderate values of N: relative errors are often below 1% for systems with N=10.
Fichier principal
Vignette du fichier
refined_meanField.pdf (1.9 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01622054 , version 1 (24-10-2017)

Identifiants

Citer

Nicolas Gast, Benny van Houdt. A Refined Mean Field Approximation. Proceedings of the ACM on Measurement and Analysis of Computing Systems , 2017, 1 (28), ⟨10.1145/3152542⟩. ⟨hal-01622054⟩
548 Consultations
1022 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More