Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model
DOI10.1007/s11134-010-9181-2zbMath1230.90068OpenAlexW2072906011MaRDI QIDQ708813
Hans Daduna, Christian Malchin
Publication date: 14 October 2010
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-010-9181-2
availabilitygeometrical nodesnetworks of discrete time queuesproduct form theoremtime reversed processunreliable nodes
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model
- Closed queueing networks with batch services
- On Jackson's product form with `jump-over' blocking
- On queueing network models of flexible manufacturing systems
- A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
- Product form stationary distributions for queueing networks with blocking and rerouting
- Asymptotic behavior of large discrete-time cyclic queueing networks
- On the characterization of departure rules for discrete-time queueing networks with batch movements and its applications
- Features of some discrete-time cyclic queueing networks
- Analysis of discrete time queues via the reversed process
- Analysis of a discrete-time \(GI-G-1\) queueing model subjected to bursty interruptions
- Insensitivity in discrete-time generalized semi-Markov processes allowing multiple events and probabilistic service scheduling
- Triggered batch movement in queueing networks
- System delay versus system content for discrete-time queueing systems subject to server interruptions
- Separable equilibrium state probabilities via time reversal in Markovian process algebra
- Stochastic Automata Networks and Near Complete Decomposability
- Networks of queues in discrete time
- A discrete-time queueing network
- Product forms for queueing networks with state-dependent multiple job transitions
- A new approach to the M/G/1 processor-sharing queue
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- Spatial birth-death processes with multiple changes and applications to batch service networks and clustering processes
- Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
- Behavior of Tandem Buffers with Geometric Input and Markovian Output
- Availability Formulas and Performance Measures for Separable Degradable Networks
- A Compositional Approach to Performance Modelling
- Time-shared Systems
- An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
- Queueing networks with discrete time scale. Explicit expressions for the steady state behaviour of discrete time stochastic networks
This page was built for publication: Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model
