|
This article is cited in 13 scientific papers (total in 13 papers)
Poisson hypothesis for information networks. II
A. N. Rybkoa, S. B. Shlosmanb a Institute for Information Transmission Problems, Russian Academy of Sciences
b CNRS – Center of Theoretical Physics
Abstract:
This is the second part of our paper. We study the Poisson Hypothesis, which is a device to analyze approximately the behavior of large queuing networks. We prove it in some simple limiting cases. We show in particular that the corresponding dynamical system, defined by the non-linear Markov process, has a line of fixed points which are global attractors. To do this we derive the corresponding non-linear equation and we explore its self-averaging properties. We also argue that in cases of heavy-tail service times the PH can be violated.
Key words and phrases:
Mean-field models, server, waiting time, phase transition, limit theorem, self-averaging property, attractor.
Received: June 14, 2005
Citation:
A. N. Rybko, S. B. Shlosman, “Poisson hypothesis for information networks. II”, Mosc. Math. J., 5:4 (2005), 927–959
Linking options:
https://www.mathnet.ru/eng/mmj229 https://www.mathnet.ru/eng/mmj/v5/i4/p927
|
Statistics & downloads: |
Abstract page: | 338 | Full-text PDF : | 1 | References: | 76 |
|