Simple error bounds for the QBD approximation of a special class of two dimensional reflecting random walks

Masuyama, Hiroyuki; Sakuma, Yutaka; Kobayashi, Masahiro

doi:10.1145/3016032.3016048

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2019

Publication Types

Select...

Book1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A Linear Programming Approach to Markov Reward Error Bounds for Queueing Networks

Bai

2019

Queueing Theory and Network Applications

View full text Add to dashboard Cite

In this paper, we present a numerical framework for constructing bounds on stationary performance measures of random walks in the positive orthant using the Markov reward approach. These bounds are established in terms of stationary performance measures of a perturbed random walk whose stationary distribution is known explicitly. We consider random walks in an arbitrary number of dimensions and with a transition probability structure that is defined on an arbitrary partition of the positive orthant. Within each component of this partition the transition probabilities are homogeneous. This enables us to model queueing networks with, for instance, break-downs and finite buffers. The main contribution of this paper is that we generalize the linear programming approach of [1] to this class of models.

show abstract

A Linear Programming Approach to Markov Reward Error Bounds for Queueing Networks

Bai

2019

Queueing Theory and Network Applications

View full text Add to dashboard Cite

show abstract