Performance measures for the two-node queue with finite buffers

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

Research output: Contribution to journalArticleAcademicpeer-review

17 Downloads (Pure)

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. The approximation scheme is developed 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. The modified approximation scheme and the corresponding applications for a two-node queueing system in which only one of the buffers has finite capacity have also been discussed.

Original languageEnglish
Number of pages28
JournalProbability in the engineering and informational sciences
DOIs
Publication statusE-pub ahead of print/First online - 26 Jun 2019

Fingerprint

Finite Buffer
Approximation Scheme
Performance Measures
Queue
Random walk
Vertex of a graph
Buffer
Tandem Queues
Finite Capacity
Product Form
Queueing System
Reward
Invariant Measure
Error Bounds
Approximation
Node
Finite buffer
Performance measures
Model

Keywords

  • error bounds
  • finite state space
  • performance measure
  • product-form
  • random walk
  • two-node queue

Cite this

@article{f4d346277ec34c2cb3015a5ab6b84844,
title = "Performance measures for the two-node queue with finite buffers",
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. The approximation scheme is developed 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. The modified approximation scheme and the corresponding applications for a two-node queueing system in which only one of the buffers has finite capacity have also been discussed.",
keywords = "error bounds, finite state space, performance measure, product-form, random walk, two-node queue",
author = "Yanting Chen and Xinwei Bai and Boucherie, {Richard J.} and Jasper Goseling",
year = "2019",
month = "6",
day = "26",
doi = "10.1017/S0269964819000238",
language = "English",
journal = "Probability in the engineering and informational sciences",
issn = "0269-9648",
publisher = "Cambridge University Press",

}

Performance measures for the two-node queue with finite buffers. / Chen, Yanting; Bai, Xinwei; Boucherie, Richard J.; Goseling, Jasper.

In: Probability in the engineering and informational sciences, 26.06.2019.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Performance measures for the two-node queue with finite buffers

AU - Chen, Yanting

AU - Bai, Xinwei

AU - Boucherie, Richard J.

AU - Goseling, Jasper

PY - 2019/6/26

Y1 - 2019/6/26

N2 - 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. The approximation scheme is developed 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. The modified approximation scheme and the corresponding applications for a two-node queueing system in which only one of the buffers has finite capacity have also been discussed.

AB - 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. The approximation scheme is developed 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. The modified approximation scheme and the corresponding applications for a two-node queueing system in which only one of the buffers has finite capacity have also been discussed.

KW - error bounds

KW - finite state space

KW - performance measure

KW - product-form

KW - random walk

KW - two-node queue

UR - http://www.scopus.com/inward/record.url?scp=85068180565&partnerID=8YFLogxK

U2 - 10.1017/S0269964819000238

DO - 10.1017/S0269964819000238

M3 - Article

AN - SCOPUS:85068180565

JO - Probability in the engineering and informational sciences

JF - Probability in the engineering and informational sciences

SN - 0269-9648

ER -