Simple bounds for queueing systems with breakdowns

Nico M. van Dijk

doi:10.1016/0166-5316(88)90017-X

Simple bounds for queueing systems with breakdowns

Nico M. van Dijk

Research output: Contribution to journal › Article › Academic

28 Citations (Scopus)

97 Downloads (Pure)

Abstract

Computationally attractive and intuitively obvious simple bounds are proposed for finite service systems which are subject to random breakdowns. The services are assumed to be exponential. The up and down periods are allowed to be generally distributed. The bounds are based on product-form modifications and depend only on means. A formal proof is presented. This proof is of interest in itself. Numerical support indicates a potential usefulness for quick engineering and performance evaluation purposes.

Original language	English
Pages (from-to)	117-128
Journal	Performance evaluation
Volume	8
Issue number	2
DOIs	https://doi.org/10.1016/0166-5316(88)90017-X
Publication status	Published - 1988

Keywords

Call congestion
Job-local-Bblance
Product form
Insensitivity
Markov chain
Bound
Breakdown
Bounding methodology

Access to Document

10.1016/0166-5316(88)90017-X

Dijk88simpleFinal published version, 721 KB

Cite this

@article{470196ecd2bf457bb36866afbfef56e0,

title = "Simple bounds for queueing systems with breakdowns",

abstract = "Computationally attractive and intuitively obvious simple bounds are proposed for finite service systems which are subject to random breakdowns. The services are assumed to be exponential. The up and down periods are allowed to be generally distributed. The bounds are based on product-form modifications and depend only on means. A formal proof is presented. This proof is of interest in itself. Numerical support indicates a potential usefulness for quick engineering and performance evaluation purposes.",

keywords = "Call congestion, Job-local-Bblance, Product form, Insensitivity, Markov chain, Bound, Breakdown, Bounding methodology",

author = "{van Dijk}, {Nico M.}",

year = "1988",

doi = "10.1016/0166-5316(88)90017-X",

language = "English",

volume = "8",

pages = "117--128",

journal = "Performance evaluation",

issn = "0166-5316",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Simple bounds for queueing systems with breakdowns

AU - van Dijk, Nico M.

PY - 1988

Y1 - 1988

N2 - Computationally attractive and intuitively obvious simple bounds are proposed for finite service systems which are subject to random breakdowns. The services are assumed to be exponential. The up and down periods are allowed to be generally distributed. The bounds are based on product-form modifications and depend only on means. A formal proof is presented. This proof is of interest in itself. Numerical support indicates a potential usefulness for quick engineering and performance evaluation purposes.

AB - Computationally attractive and intuitively obvious simple bounds are proposed for finite service systems which are subject to random breakdowns. The services are assumed to be exponential. The up and down periods are allowed to be generally distributed. The bounds are based on product-form modifications and depend only on means. A formal proof is presented. This proof is of interest in itself. Numerical support indicates a potential usefulness for quick engineering and performance evaluation purposes.

KW - Call congestion

KW - Job-local-Bblance

KW - Product form

KW - Insensitivity

KW - Markov chain

KW - Bound

KW - Breakdown

KW - Bounding methodology

U2 - 10.1016/0166-5316(88)90017-X

DO - 10.1016/0166-5316(88)90017-X

M3 - Article

VL - 8

SP - 117

EP - 128

JO - Performance evaluation

JF - Performance evaluation

SN - 0166-5316

IS - 2

ER -

Simple bounds for queueing systems with breakdowns

Abstract

Keywords

Access to Document

Fingerprint

Cite this