A discrete-time queueing network

DOI10.2307/3213603MaRDI QIDQ3042133zbMATH OpenOpenAlexFDO

Authors Jean Walrand

Publication date 1983

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3213603

zbMATH Keywords

reversibilityqueuing networkproduct formJackson-type networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cited in

(16)

• Open queueing networks in discrete time -- some limit theorems
• An approximate solution and error bound for a discrete time queue with simultaneous servicing
• Distributionally robust scheduling of stochastic knapsack arrivals
• Closed queueing networks with batch services
• Queueing systems of INAR(1) processes with compound Poisson arrivals
• An urn model with Bernoulli removals and independent additions
• Features of some discrete-time cyclic queueing networks
• On the characterization of departure rules for discrete-time queueing networks with batch movements and its applications
• Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model
• Triggered batch movement in queueing networks
• Product form in networks of queues with batch arrivals and batch services
• Transient product form distributions in queueing networks
• A general formulation for mean-value analysis in product-form batch- movement queueing networks
• Quasi-reversibility of a discrete-time queue and related models
• Mathematical theory of queueing networks
• Testing for Poisson arrivals in INAR(1) processes

This page was built for publication: A discrete-time queueing network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3042133)