Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model
type: Item
instance of: scholarly article
title: Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model
zbMATH Open document ID: 1230.90068
author: Christian Malchin
author: Hans Daduna
published in: Queueing Systems
publication date: 2010-10-14T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5800295
zbMATH Keywords: networks of discrete time queues
zbMATH Keywords: unreliable nodes
zbMATH Keywords: availability
zbMATH Keywords: time reversed process
zbMATH Keywords: product form theorem
zbMATH Keywords: geometrical nodes
MaRDI profile type: Publication
full work available at URL: s11134-010-9181-2
OpenAlex ID: W2072906011
cites work: Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
cites work: Spatial birth-death processes with multiple changes and applications to batch service networks and clustering processes
cites work: Product forms for queueing networks with state-dependent multiple job transitions
cites work: On queueing network models of flexible manufacturing systems
cites work: Q4894813
cites work: Q4255469
cites work: Q2730382
cites work: Queueing networks with discrete time scale. Explicit expressions for the steady state behaviour of discrete time stochastic networks
cites work: A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
cites work: Networks of queues in discrete time
cites work: Product form stationary distributions for queueing networks with blocking and rerouting
cites work: Analysis of a discrete-time \(GI-G-1\) queueing model subjected to bursty interruptions
cites work: Stochastic automata networks and near complete decomposability
cites work: Separable equilibrium state probabilities via time reversal in Markovian process algebra
cites work: Closed queueing networks with batch services
cites work: Triggered batch movement in queueing networks
cites work: Insensitivity in discrete-time generalized semi-Markov processes allowing multiple events and probabilistic service scheduling
cites work: A Compositional Approach to Performance Modelling
cites work: Behavior of Tandem Buffers with Geometric Input and Markovian Output
cites work: Time-shared Systems
cites work: Q4101255
cites work: Q4134686
cites work: Q3126555
cites work: On the characterization of departure rules for discrete-time queueing networks with batch movements and its applications
cites work: Q4895169
cites work: Asymptotic behavior of large discrete-time cyclic queueing networks
cites work: Features of some discrete-time cyclic queueing networks
cites work: Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
cites work: An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
cites work: Q3521164
cites work: Availability Formulas and Performance Measures for Separable Degradable Networks
cites work: A new approach to the M/G/1 processor-sharing queue
cites work: Q4265492
cites work: On Jackson's product form with `jump-over' blocking
cites work: System delay versus system content for discrete-time queueing systems subject to server interruptions
cites work: A discrete-time queueing network
cites work: Analysis of discrete time queues via the reversed process
DOI: 10.1007/S11134-010-9181-2
description: scientific article; zbMATH DE number 5800295