A generalization of Norton's theorem for queueing networks
From MaRDI portal
Publication:1801812
DOI10.1007/BF01158934zbMath0790.60074OpenAlexW2040592489MaRDI QIDQ1801812
Nico M. van Dijk, Richard J. Boucherie
Publication date: 20 June 1994
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158934
Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (6)
On the characterization of departure rules for discrete-time queueing networks with batch movements and its applications ⋮ On the cycle maximum of birth-death processes and networks of queues ⋮ NORTON'S THEOREM FOR BATCH ROUTING QUEUEING NETWORKS ⋮ State-dependent stochastic networks. I: Approximation and applications with continuous diffusion limits ⋮ On product form tandem structures ⋮ On two product form modifications for finite overflow systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markovian network processes: Congestion-dependent routing and processing
- Product form in networks of queues with batch arrivals and batch services
- Interconnections of Markov chains and quasi-reversible queuing networks
- `Stop=recirculate' for exponential product form queueing networks with departure blocking
- Product forms for queueing networks with state-dependent multiple job transitions
- A note on Norton's theorem for queuing networks
- A New Method For Computing The Normalization Constant Of Multiple-Chain Queueing Networks
- Connecting reversible Markov processes
- A generalisation of Norton's theorem for multiclass queueing networks
- Parametric Analysis of Queuing Networks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Exact Aggregation in Exponential Queueing Networks
This page was built for publication: A generalization of Norton's theorem for queueing networks
