Abstract
We describe our results concerning the proof of the Poisson hypothesis. We explain the probabilistic aspect of our results and present the main combinatorial step of our proof. That combinatorial statement deals with counting the number of rod placements on a line.
Similar content being viewed by others
REFERENCES
Kleinrock, L., Communication Nets; Stochastic Message Flow and Delay, New York: McGraw-Hill, 1964.
Dobrushin, R.L., private communication; see also [5].
Borovkov, A.A., talk given at INRIA, France, 1995; see also [6].
Rybko, A.N. and Shlosman, S.B., Poisson Hypothesis for Information Networks (A Study in Non-linear Markov Processes), 2003. Available at http://fr.arxiv.org/abs/math-ph/0303010 (submitted to Ann. Probab.).
Dobrushin, R.L. and Sukhov, Yu.M., Asymptotic Investigation of Star-Shaped Message Switching Networks with a Large Number of Radial Rays, Probl. Peredachi Inf., 1976, vol. 12, no.1, pp. 70–94 [Probl. Inf. Trans. (Engl. Transl.), 1976, vol. 12, no. 1, pp. 49–66].
Borovkov, K.A., Propagation of Chaos in Queueing Networks, Teor. Veroyatn. Primen., 1997, vol. 42, no.3, pp. 449–460 [Theory Probab. Appl. (Engl. Transl.), 1997, vol. 42, no. 3, pp. 385–394.]
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. Trans. (Engl. Transl.), 2000, vol. 36, no. 2, pp. 154–179].
Author information
Authors and Affiliations
Additional information
__________
Translated from Problemy Peredachi Informatsii, No. 3, 2005, pp. 51–57.
Original Russian Text Copyright © 2005 by Rybko, Shlosman.
Rights and permissions
About this article
Cite this article
Rybko, A.N., Shlosman, S.B. Poisson Hypothesis: Combinatorial Aspect. Probl Inf Transm 41, 230–236 (2005). https://doi.org/10.1007/s11122-005-0027-1
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11122-005-0027-1