Skip to main content
Log in

Propagation of Chaos and Poisson Hypothesis

  • Communication Network Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We establish the strong Poisson hypothesis for symmetric closed networks. In particular, we prove asymptotic independence of nodes as the size of the system tends to infinity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Karpelevich, F.I. and Rybko, A.N., Asymptotic Behavior of the Thermodynamical Limit for Symmetric Closed Queueing Networks, Probl. Peredachi Inf., 2000, vol. 36, no. 2, pp. 69–95 [Probl. Inf. Transm. (Engl. Transl.), 2000, vol. 36, no. 2, pp. 154–179].

    MathSciNet  MATH  Google Scholar 

  2. Rybko, A.N. and Shlosman, S.B., Poisson Hypothesis for Information Networks. I, II, Mosc. Math. J., 2005, vol. 5, no. 3, pp. 679–704; no. 4, pp. 927–959.

    MathSciNet  MATH  Google Scholar 

  3. Baccelli, F., Rybko, A.N., and Shlosman, S.B., Queueing Networks with Mobile Servers: The Mean-Field Approach, Probl. Peredachi Inf., 2016, vol. 52, no. 2, pp. 86–110 [Probl. Inf. Transm. (Engl. Transl.), 2016, vol. 52, no. 2, pp. 178–199].

    MathSciNet  MATH  Google Scholar 

  4. Bramson, M., Lu, Y., and Prabhakar, B., Asymptotic Independence of Queues under Randomized Load Balancing, Queueing Syst., 2012, vol. 71, no. 3, pp. 247–292.

    Article  MathSciNet  MATH  Google Scholar 

  5. Bramson, M., Lu, Y., and Prabhakar, B., Randomized Load Balancing with General Service Time Distributions, in Proc. ACM SIGMETRICS Int. Conf. on Measurement and Modeling of Computer Systems (SIGMETRICS’2010), June 14–18, 2010, New York, USA, pp. 275–286.

    Google Scholar 

  6. Stolyar, A.L., Asymptotics of Stationary Distribution for a Closed Queueing System, Probl. Peredachi Inf., 1989, vol. 25, no. 4, pp. 80–92 [Probl. Inf. Transm. (Engl. Transl.), 1989, vol. 25, no. 4, pp. 321–331].

    MathSciNet  Google Scholar 

  7. McKean, H.P., Jr., An Exponential Formula for Solving Boltzmann’s Equation for a Maxwellian Gas, J. Combin. Theory, 1967, vol. 2, no. 3, pp. 358–382.

    Article  MATH  Google Scholar 

  8. Liggett, T.M., Interacting Particle Systems, New York: Springer, 1985.

    Book  MATH  Google Scholar 

  9. Rybko, A., Shlosman, S., and Vladimirov, A., Spontaneous Resonances and the Coherent States of the Queuing Networks, J. Stat. Phys., 2008, vol. 134, no. 1, pp. 67–104.

    Article  MathSciNet  MATH  Google Scholar 

  10. Rybko, A. and Shlosman, S., Phase Transitions in the Queuing Networks and the Violation of the Poisson Hypothesis, Mosc. Math. J., 2008, vol. 8, no. 1, pp. 159–180.

    MathSciNet  MATH  Google Scholar 

  11. Graham, C., Chaoticity for Multiclass Systems and Exchangeability within Classes, J. Appl. Probab. 2008, vol. 45, no. 4, pp. 1196–1203.

    Google Scholar 

  12. Petrova, E.N. and Pirogov, S.A., On “Asymptotic Independence...” by V.M. Gertsik, Markov Process. Related Fields, 2014, vol. 20, no. 2, pp. 381–384.

    MathSciNet  MATH  Google Scholar 

  13. Sznitman, A.-S., Topics in Propagation of Chaos, École d’ Été de Probabilités de Saint-Flour XIX—1989, Hennequin, P.-L., Ed., Lect. Notes Math., vol. 1464, Berlin: Springer, 1991, pp. 165–251.

    Google Scholar 

  14. Baccelli, F. and Foss, S., Ergodicity of Jackson-type Queueing Networks, Queueing Systems Theory Appl., 1994, vol. 17, no. 1–2, pp. 5–72.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. A. Vladimirov.

Additional information

Original Russian Text © A.A. Vladimirov, S.A. Pirogov, A.N. Rybko, S.B. Shlosman, 2018, published in Problemy Peredachi Informatsii, 2018, Vol. 54, No. 3, pp. 102–111.

The research of A. Rybko and A. Vladimirov (the results of Sections 3–5) was carried out at the Institute for Information Transmission Problems of the Russian Academy of Sciences at the expense of the Russian Science Foundation, project no. 14-50-00150.

The research of S. Pirogov, presented in Section 6, was carried out at the expense of the Russian Science Foundation, project no. 17-11-01098.

The work of S. Shlosman, presented in Sections 1–2, was performed in the framework of the Labex Archimede (ANR-11-LABX-0033) and the A*MIDEX project (ANR-11-IDEX-0001-02), funded by the “Investissements d’Avenir” French Government programme managed by the French National Research Agency (ANR); it was also supported by the Grant PRC no. 1556 CNRS-RFBR 2017–2019 “Multidimensional semi-classical problems of condensed matter physics and quantum mechanics.”

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vladimirov, A.A., Pirogov, S.A., Rybko, A.N. et al. Propagation of Chaos and Poisson Hypothesis. Probl Inf Transm 54, 290–299 (2018). https://doi.org/10.1134/S0032946018030080

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946018030080