PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS

DOI10.1017/S0269964819000238zbMATH Open1483.60134arXiv1502.07872OpenAlexW1642033914MaRDI QIDQ5070869FDOQ5070869

Authors: Yanting Chen, Xinwei Bai, Richard J. Boucherie, Jasper Goseling 

Publication date: 14 April 2022

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Abstract: We consider a two-node queue modeled as a two-dimensional random walk. In particular, we consider the case that one or both queues have finite buffers. We develop an approximation scheme based on the Markov reward approach to error bounds in order to bound performance measures of such random walks in terms of a perturbed random walk in which the transitions along the boundaries are different from those in the original model and the invariant measure of the perturbed random walk is of product-form. We then apply this approximation scheme to a tandem queue and some variants of this model, for the case that both buffers are finite. We also apply our approximation scheme to a coupled-queue in which only one of the buffers has finite capacity.

Full work available at URL: https://arxiv.org/abs/1502.07872

Recommendations

• Bounding the performance of tandem queues with finite buffer spaces
• On a synchronization queue with two finite buffers
• On a generic class of two-node queueing systems
• Performance evaluation of closed tandem queueing networks with finite buffers
• Performance Evaluation in a Queueing System M 2/G/1
• Optimal buffer allocation in a two-stage queueing system
• Performance bounds for nonhomogeneous queues
• Performance evaluation of open queueing networks with arbitrary configuration and finite buffers

zbMATH Keywords

random walkerror boundsperformance measureproduct-formfinite state spacetwo-node queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Sums of independent random variables; random walks (60G50)

Cites Work

• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Two coupled processors: The reduction to a Riemann-Hilbert problem
• Numerical Methods for Structured Markov Chains
• Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process
• Solving matrix polynomial equations arising in queueing problems
• A Tandem Queue with Server Slow-Down and Blocking
• Simple Bounds for Finite Single-Server Exponential Tandem Queues
• Two-stations queueing networks with moving servers, blocking, and customer loss
• An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
• A linear programming approach to error bounds for random walks in the quarter-plane.
• Error bounds and comparison results: the Markov reward approach for queueing networks
• Tail decay rates in double QBD processes and related reflected random walks
• Invariant measures and error bounds for random walks in the quarter-plane based on sums of geometric terms
• Perturbation theory for Markov reward processes with applications to queueing systems
• Title not available (Why is that?)
• Performance analysis of multi-server tandem queues with finite buffers and blocking
• Solution of finite QBD processes
• On the Solution to QBD Processes with Finite State Space
• On the optimal design of tandem queueing systems with finite buffers
• Asymptotic analysis of two coupled queues with vastly different arrival rates and finite customer capacities
• Product form stationary distributions for queueing networks with blocking and rerouting
• A survey of product form queueing networks with blocking and their equivalences
• A product-form ‘loss network' with a form of queueing
• Bounding the performance of tandem queues with finite buffer spaces
• Queues with boundary assistance: The effects of truncation
• State-dependent importance sampling for a slowdown tandem queue
• Birth-and-death processes on the integers with phases and general boundaries
• Simple bounds and monotonicity results for finite multi-server exponential tandem queues
• Simple bounds for queueing systems with breakdowns
• Bounds and error bounds for queueing networks
• Error Bounds for Perturbing Nonexponential Queues
• Monotonicity and error bounds for networks of Erlang loss queues
• Algorithms for quadratic matrix and vector equations
• A quadratically convergent Bernoulli-like algorithm for solving matrix polynomial equations in Markov chains
• A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
• A decomposition approximation for assembly-disassembly queueing networks with finite buffer and blocking

Cited In (2)

• Simple error bounds for the QBD approximation of a special class of two dimensional reflecting random walks
• On a synchronization queue with two finite buffers

Uses Software

• SMCSolver

This page was built for publication: PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS

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