Treelike queueing networks: Asymptotic stationarity and heavy traffic

From MaRDI portal





Limiting distributions for waiting times and queue lengths in treelike networks with single-server nodes are established. The main results are: (1) Characterization of the limiting distributions with asymptotical stationarity; this result generalizes that of Borovkov. (2) Characterization of functionals of sequences preserving the asymptotic stationarity.



Cites work









This page was built for publication: Treelike queueing networks: Asymptotic stationarity and heavy traffic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296745)