Poisson Hypothesis for Information Networks (A study in non-linear Markov processes) I. Domain of Validity

Simple item page
dc.creatorRybko, A.
dc.creatorShlosman, S.
dc.date2004-06-07
dc.date.accessioned2026-07-07T05:08:56Z
dc.date.available2026-07-07T05:08:56Z
dc.descriptionIn this paper we study the Poisson Hypothesis, which is a device to analyze approximately the behavior of large queueing 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 havy-tail service times the PH can be violated.
dc.description77 pages
dc.identifierhttps://arxiv.org/abs/math/0406110
dc.identifierhttp://arxiv.org/abs/math/0406110
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71456
dc.subjectProbability
dc.subjectMathematical Physics
dc.subject82C20; 60J25
dc.titlePoisson Hypothesis for Information Networks (A study in non-linear Markov processes) I. Domain of Validity
dc.typetext

Files

Collections

arXiv