NORTON'S THEOREM FOR BATCH ROUTING QUEUEING NETWORKS
From MaRDI portal
Publication:2746239
DOI10.1081/STM-100001399zbMath0994.90049OpenAlexW2163261627MaRDI QIDQ2746239
Falko Bause, Peter Buchholz, Richard J. Boucherie
Publication date: 10 October 2001
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/stm-100001399
Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- An extension to Norton's equivalent
- Product form in networks of queues with batch arrivals and batch services
- Closed queueing networks with batch services
- A generalization of Norton's theorem for queueing networks
- A net level performance analysis of stochastic Petri nets
- Product-form discrete-time queues in series with batch transition: late arrival case
- Product forms for queueing networks with state-dependent multiple job transitions
- Product-Form Synthesis of Queueing Networks
- A note on Norton's theorem for queuing networks
- Some new results on queueing networks with batch movement
- Queuing Network Models with State-Dependent Routing
- A generalisation of Norton's theorem for multiclass queueing networks
- An Extension of Norton's Theorem for Queueing Networks
- Parametric Analysis of Queuing Networks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Networks of queues
- Exact Aggregation in Exponential Queueing Networks
- On closed support T-Invariants and the traffic equations
- Norton's equivalent for batch routing queueing networks with independently routing customers
