Open queueing networks in discrete time -- some limit theorems
From MaRDI portal
Publication:688657
Recommendations
Cites work
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 941166 (Why is no real title available?)
- scientific article; zbMATH DE number 3236503 (Why is no real title available?)
- scientific article; zbMATH DE number 3322728 (Why is no real title available?)
- A discrete-time queueing network
- An Asymptotic Analysis of a Queueing System with Markov-Modulated Arrivals
- Delay analysis of discrete-time priority queue with structured inputs
- Discrete-Time Queueing Systems and Their Networks
- General Irreducible Markov Chains and Non-Negative Operators
- Ladder heights and the Markov-modulated M/G/1 queue
- Limit Theorems for Queueing Networks. I
- Networks of queues in discrete time
- New results on the single server queue with a batch markovian arrival process
- Queueing Models for Computer Communications System Analysis
- Queueing Networks: A Survey of Their Random Processes
- Some Invariance Principles for Functionals of a Markov Chain
- The doubly stochastic server: A time-sharing model
- The existence of moments for stationary Markov chains
- The single server queue in discrete time‐numerical analysis IV
- The stability of open queueing networks
- Two Discrete-Time Queues in Tandem
- Two competing discrete-time queues with priority
- Waiting times in discrete-time cyclic-service systems
Cited in
(11)- scientific article; zbMATH DE number 4030671 (Why is no real title available?)
- scientific article; zbMATH DE number 4130168 (Why is no real title available?)
- Discrete operator-selfdecomposabiuty and queueing networks
- Stationary deterministic flows in discrete systems. I
- Limit Theorems for Queueing Networks. I
- The stability of open queueing networks
- On the analysis of the virtual waiting time in open queueing networks
- Monotonicity and asymptotic queue-length distribution in discrete-time networks
- The stability of infinite-server networks with random routing
- Stochastic monotonicity in general queueing networks
- A stochastic process on a network with connections to Laplacian systems of equations
This page was built for publication: Open queueing networks in discrete time -- some limit theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688657)