skip to main content
research-article

A Refined Mean Field Approximation

Published:19 December 2017Publication History
Skip Abstract Section

Abstract

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.

References

  1. R. H. Bartels and G. W. Stewart. 1972. Solution of the Matrix Equation AX + XB = C {F4}. Commun. ACM 15, 9 (Sept. 1972), 820--826. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Michel Benaim and Jean-Yves Le Boudec. 2008. A class of mean field interaction models for computer and communication systems. Performance Evaluation 65, 11 (2008), 823--838. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Luca Bortolussi, Jane Hillston, Diego Latella, and Mieke Massink. 2013. Continuous approximation of collective system behaviour: A tutorial. Performance Evaluation 70, 5 (2013), 317--349. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Anton Braverman and Jim Dai. 2017. Stein's method for steady-state diffusion approximations of M/Ph/n + M systems. The Annals of Applied Probability 27, 1 (2017), 550--581.Google ScholarGoogle ScholarCross RefCross Ref
  5. Anton Braverman, JG Dai, and Jiekun Feng. 2017. Stein's method for steady-state diffusion approximations: an introduction through the Erlang-A and Erlang-C models. Stochastic Systems 6, 2 (2017), 301--366.Google ScholarGoogle ScholarCross RefCross Ref
  6. Jeong-woo Cho, Jean-Yves Le Boudec, and Yuming Jiang. 2012. On the asymptotic validity of the decoupling assumption for analyzing 802.11 MAC protocol. IEEE Transactions on Information Theory 58, 11 (2012), 6879--6893. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Richard Datko. 1972. Uniform asymptotic stability of evolutionary processes in a Banach space. SIAM Journal on Mathematical Analysis 3, 3 (1972), 428--445.Google ScholarGoogle ScholarCross RefCross Ref
  8. Jaap Eldering. 2013. Normally Hyperbolic Invariant Manifolds-the Noncompact Case (Atlantis Series in Dynamical Systems vol 2). Springer, Berlin.Google ScholarGoogle Scholar
  9. Nicolas Gast. 2017. Expected values estimated via mean-field approximation are 1/N-accurate. Proceedings of the ACM on Measurement and Analysis of Computing Systems 1, 1 (2017), 17. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Nicolas Gast and Gaujal Bruno. 2010. A Mean Field Model of Work Stealing in Large-scale Systems. SIGMETRICS Perform. Eval. Rev. 38, 1 (June 2010), 13--24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. N. Gast and B. Gaujal. 2012. Markov chains with discontinuous drifts have differential inclusion limits. Performance Evaluation 69, 12 (2012), 623--642. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Itai Gurvich et al. 2014. Diffusion models and steady-state approximations for exponentially ergodic Markovian queues. The Annals of Applied Probability 24, 6 (2014), 2527--2559.Google ScholarGoogle ScholarCross RefCross Ref
  13. Eric Jones, Travis Oliphant, Pearu Peterson, et al. 2001--. SciPy: Open source scientific tools for Python. (2001--). http://www.scipy.org/ {Online; accessed 2017-06--15}.Google ScholarGoogle Scholar
  14. H. K. Khalil. 1996. Nonlinear Systems (2nd ed.). Prentice-Hall, Englewood Cliffs, NJ.Google ScholarGoogle Scholar
  15. Thomas G Kurtz. 1970. Solutions of Ordinary Differential Equations as Limits of Pure Jump Markov Processes. Journal of Applied Probability 7 (1970), 49--58.Google ScholarGoogle ScholarCross RefCross Ref
  16. Thomas G Kurtz. 1978. Strong approximation theorems for density dependent Markov chains. Stochastic Processes and Their Applications 6, 3 (1978), 223--240.Google ScholarGoogle ScholarCross RefCross Ref
  17. G. Latouche and V. Ramaswami. 1999. Introduction to Matrix Analytic Methods and stochastic modeling. SIAM, Philadelphia.Google ScholarGoogle Scholar
  18. Jean-Yves Le Boudec, David McDonald, and Jochen Mundinger. 2007. A generic mean field convergence result for systems of interacting objects. In Quantitative Evaluation of Systems, 2007. QEST 2007. Fourth International Conference on the. IEEE, 3--18. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. Lin, B. Fan, J.C.S. Lui, and D. Chiu. 2007. Stochastic analysis of file-swarming systems. Performance Evaluation 64, 9 (2007), 856--875. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. L. Massoulié and M. Vojnović. 2005. Coupon Replication Systems. SIGMETRICS Perform. Eval. Rev. 33, 1 (June 2005), 2--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. W. Minnebo and B. Van Houdt. 2014. A Fair Comparison of Pull and Push Strategies in Large Distributed Networks. IEEE/ACM Transactions on Networking 22 (2014), 996--1006. Issue 3. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Michael Mitzenmacher. 2001. The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems 12, 10 (2001), 1094--1104. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Michael David Mitzenmacher. 1996. The Power of Two Random Choices in Randomized Load Balancing. Ph.D. Dissertation. PhD thesis, Graduate Division of the University of California at Berkley.Google ScholarGoogle Scholar
  24. Cristopher Moore. 1990. Unpredictability and undecidability in dynamical systems. Physical Review Letters 64, 20 (1990), 2354.Google ScholarGoogle ScholarCross RefCross Ref
  25. Vu Ngoc Phat and Tran Tin Kiet. 2002. On the Lyapunov equation in Banach spaces and applications to control problems. International Journal of Mathematics and Mathematical Sciences 29, 3 (2002), 155--166.Google ScholarGoogle ScholarCross RefCross Ref
  26. V. Simoncini. 2016. Computational methods for linear matrix equations. SIAM Rev. 58 (2016), 377--441. Issue 3.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. John N Tsitsiklis and Kuang Xu. 2011. On the power of (even a little) centralization in distributed processing. ACM SIGMETRICS Performance Evaluation Review 39, 1 (2011), 121--132. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Benny Van Houdt. 2013. A mean field model for a class of garbage collection algorithms in flash-based solid state drives. In ACM SIGMETRICS Performance Evaluation Review, Vol. 41. ACM, ACM, New York, NY, USA, 191--202. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Nikita Dmitrievna Vvedenskaya, Roland L'vovich Dobrushin, and Fridrikh Izrailevich Karpelevich. 1996. Queueing system with selection of the shortest of two queues: An asymptotic approach. Problemy Peredachi Informatsii 32, 1 (1996), 20--34.Google ScholarGoogle Scholar
  30. Q. Xie, X. Dong, Y. Lu, and R. Srikant. 2015. Power of D Choices for Large-Scale Bin Packing: A Loss Model. SIGMETRICS Perform. Eval. Rev. 43, 1 (June 2015), 321--334. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Lei Ying. 2016. On the Approximation Error of Mean-Field Models. In Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science (SIGMETRICS '16). ACM, New York, NY, USA, 285--297. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Lei Ying. 2017. Stein's Method for Mean Field Approximations in Light and Heavy Traffic Regimes. Proceedings of the ACM on Measurement and Analysis of Computing Systems 1, 1 (2017), 12. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A Refined Mean Field Approximation

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!