Poisson Hypothesis for Open Networks at Low Load
From MaRDI portal
Abstract: We study large communication networks of the mean-field type. The input flows to the nodes of the network are supposed to be stationary and with low rate. We show that such a network is ergodic, i.e. it goes to the stationary state, which does not depend on the initial state of the network. This is in contrast with the high load regime, when the large time behavior of the network might depend on its initial state. Our technique is based on the coupling construction, which couples two Non-Linear Markov Processes.
Recommendations
- Absence of Breakdown of the Poisson Hypothesis I. Closed Networks at Low Load
- Poisson limit theorem for message switching networks with low transit traffic
- scientific article; zbMATH DE number 932438
- Poisson hypothesis for information networks. I
- Poisson hypothesis for information networks. II
- Poisson approximation and connectivity in a scale-free random connection model
- Poisson approximations for telecommunications networks
- Stationary States of the Generalized Jackson Networks
- On Some Inequalities for Poisson Networks
- scientific article; zbMATH DE number 3870296
Cited in
(9)- Proof of the Poisson hypothesis for circuit-switching loss networks
- On mean-field (\(\mathrm{GI}/\mathrm{GI}/1\)) queueing model: existence and uniqueness
- Nonlinear Markov processes in big networks
- Simulating the Tail of the Interference in a Poisson Network Model
- Poisson hypothesis for information networks. I
- Absence of Breakdown of the Poisson Hypothesis I. Closed Networks at Low Load
- scientific article; zbMATH DE number 1488838 (Why is no real title available?)
- scientific article; zbMATH DE number 933355 (Why is no real title available?)
- Poisson hypothesis for information networks. II
This page was built for publication: Poisson Hypothesis for Open Networks at Low Load
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365015)
