Importance sampling for non-Markovian tandem queues using subsolutions

Anne  Buijsrogge; Pieter-Tjerk  de Boer; Werner R.W. Scheinhardt

doi:10.1007/s11134-019-09623-0

Importance sampling for non-Markovian tandem queues using subsolutions

Anne Buijsrogge^*, Pieter-Tjerk de Boer, Werner R.W. Scheinhardt

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

2 Citations (Scopus)

20 Downloads (Pure)

Abstract

In this paper, we use importance sampling simulation to estimate the probability that the number of customers in a d-node GI|GI|1 tandem queue reaches some high level N in a busy cycle of the system. We present a state-dependent change of measure for a d-node GI|GI|1 tandem queue based on the subsolution approach, and we prove, under a mild conjecture, that this state-dependent change of measure gives an asymptotically efficient estimator for the probability of interest when all supports are bounded.

Original language	English
Pages (from-to)	31-65
Number of pages	35
Journal	Queueing systems
Volume	93
Issue number	1-2
Early online date	16 Jul 2019
DOIs	https://doi.org/10.1007/s11134-019-09623-0
Publication status	Published - 1 Oct 2019

Keywords

GI|GI|1 queues
Importance sampling
Rare event simulation
Tandem queues

Access to Document

10.1007/s11134-019-09623-0Licence: CC BY

Cite this

@article{36b456a4804a49399e161a535ea3c1a2,

title = "Importance sampling for non-Markovian tandem queues using subsolutions",

abstract = "In this paper, we use importance sampling simulation to estimate the probability that the number of customers in a d-node GI|GI|1 tandem queue reaches some high level N in a busy cycle of the system. We present a state-dependent change of measure for a d-node GI|GI|1 tandem queue based on the subsolution approach, and we prove, under a mild conjecture, that this state-dependent change of measure gives an asymptotically efficient estimator for the probability of interest when all supports are bounded. ",

keywords = "GI|GI|1 queues, Importance sampling, Rare event simulation, Tandem queues",

author = "Anne Buijsrogge and {de Boer}, Pieter-Tjerk and Scheinhardt, {Werner R.W.}",

note = "Springer deal",

year = "2019",

month = oct,

day = "1",

doi = "10.1007/s11134-019-09623-0",

language = "English",

volume = "93",

pages = "31--65",

journal = "Queueing systems",

issn = "0257-0130",

publisher = "Springer",

number = "1-2",

}

TY - JOUR

T1 - Importance sampling for non-Markovian tandem queues using subsolutions

AU - Buijsrogge, Anne

AU - de Boer, Pieter-Tjerk

AU - Scheinhardt, Werner R.W.

N1 - Springer deal

PY - 2019/10/1

Y1 - 2019/10/1

N2 - In this paper, we use importance sampling simulation to estimate the probability that the number of customers in a d-node GI|GI|1 tandem queue reaches some high level N in a busy cycle of the system. We present a state-dependent change of measure for a d-node GI|GI|1 tandem queue based on the subsolution approach, and we prove, under a mild conjecture, that this state-dependent change of measure gives an asymptotically efficient estimator for the probability of interest when all supports are bounded.

AB - In this paper, we use importance sampling simulation to estimate the probability that the number of customers in a d-node GI|GI|1 tandem queue reaches some high level N in a busy cycle of the system. We present a state-dependent change of measure for a d-node GI|GI|1 tandem queue based on the subsolution approach, and we prove, under a mild conjecture, that this state-dependent change of measure gives an asymptotically efficient estimator for the probability of interest when all supports are bounded.

KW - GI|GI|1 queues

KW - Importance sampling

KW - Rare event simulation

KW - Tandem queues

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

U2 - 10.1007/s11134-019-09623-0

DO - 10.1007/s11134-019-09623-0

M3 - Article

SN - 0257-0130

VL - 93

SP - 31

EP - 65

JO - Queueing systems

JF - Queueing systems

IS - 1-2

ER -

Importance sampling for non-Markovian tandem queues using subsolutions

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this