Networks of queues in discrete time

DOI10.1007/BF01916912zbMath0524.90040OpenAlexW1964624132MaRDI QIDQ3037098

Hans Daduna, R. Schassberger

Publication date: 1983

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01916912

zbMATH Keywords

discrete timenetworks of queuesconditional expected travel timeround-robin operationstationary law of product form

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

Features of some discrete-time cyclic queueing networks ⋮ Decomposability in queues with background states ⋮ Product form in networks of queues with batch arrivals and batch services ⋮ Mathematical theory of queueing networks ⋮ Closed queueing networks with batch services ⋮ On Kelly networks with shuffling ⋮ Open queueing networks in discrete time -- some limit theorems ⋮ Insensitivity in discrete time queues with a moving server ⋮ Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model ⋮ An approximate solution and error bound for a discrete time queue with simultaneous servicing

Cites Work

• Unnamed Item
• A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
• On the response time distribution in a discrete round-robin queue
• Controlled queueing systems
• Sojourn times and the overtaking condition in Jacksonian networks
• The doubly stochastic server: A time-sharing model
• Insensitive average residence times in generalized semi-Markov processes
• Passage times for overtake-free paths in Gordon–Newell networks
• Sojourn Times in Queueing Networks
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Networks of queues
• Analysis of A time‐shared processor
• Closed Queuing Systems with Exponential Servers
• Time-shared Systems
• On the relation between customer and time averages in queues

This page was built for publication: Networks of queues in discrete time