Simple bounds and monotonicity results for finite multi-server exponential tandem queues

DOI10.1007/BF01150852zbMath0664.60093OpenAlexW2002816033MaRDI QIDQ1115029

Jan van der Wal, Nico M. van Dijk

Publication date: 1989

Published in: Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

tandem queuesmonotonicity resultsproduct-formNumerical computationscall congestion

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (19)

GENERALIZED CLASS [script C MARKOV CHAINS AND COMPUTATION OF CLOSED-FORM BOUNDING DISTRIBUTIONS] ⋮ Buffer allocation for a class of nonlinear stochastic knapsack problems ⋮ Buffer allocation for an integer nonlinear network design problem ⋮ PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS ⋮ Error bounds on a practical approximation for finite tandem queues ⋮ Approximate uniformization for continuous-time Markov chains with an application to performability analysis ⋮ On product form approximations for communication networks with losses: Error bounds ⋮ Performance bounds on multiserver exponential tandem queues with finite buffers ⋮ Erlang loss bounds for OT-ICU systems ⋮ Stochastic Bounds for Queueing Systems with Multiple On–Off Sources ⋮ A Simple Performability Estimate for Jackson Networks with an Unreliable Output Channel ⋮ Unnamed Item ⋮ Exact analysis of a two-workstation one-buffer flow line with parallel unreliable machines ⋮ Simple performance estimates and error bounds for slotted ALOHA loss systems ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Unnamed Item ⋮ The M/M/c with critical jobs ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system ⋮ Open finite queueing networks with \(M/M/C/K\) parallel servers

Cites Work

• Unnamed Item
• Unnamed Item
• Some properties of the throughput function of closed networks of queues
• A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
• Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
• Finite capacity assembly-like queues
• Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay Systems
• Simple bounds for queueing systems with breakdowns
• A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
• Stochastic inequalities for an overflow model
• Simple Bounds for Finite Single-Server Exponential Tandem Queues
• Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
• Monotonicity of throughput in non-Markovian networks
• Comparing counting processes and queues
• Poisson Arrivals See Time Averages

This page was built for publication: Simple bounds and monotonicity results for finite multi-server exponential tandem queues