Omnithermal Perfect Simulation for Multi-server Queues

Stephen Bryan Connor

Omnithermal Perfect Simulation for Multi-server Queues

Mathematics

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

Abstract

A number of perfect simulation algorithms for multi-server First Come First Served queues have recently been developed. Those of Connor and Kendall [6] and Blanchet et al. [4] use dominated Coupling from the Past (domCFTP) to sample from the equilibrium distribution of the Kiefer-Wolfowitz workload vector for stable M /G/c and G I /G I /c queues respectively, using Random Assignment queues as dominating processes. In this note we answer a question posed by Connor and Kendall [6], by demonstrating how these algorithms may be modified in order to carry out domCFTP simultaneously for a range of values of c (the number of servers).

Original language	English
Number of pages	15
Journal	ACM Transactions on Modeling and Computer Simulation
Publication status	Accepted/In press - 9 Sept 2019

Cite this

@article{0730b138db8a4fbb84a58716c6a612ff,

title = "Omnithermal Perfect Simulation for Multi-server Queues",

abstract = "A number of perfect simulation algorithms for multi-server First Come First Served queues have recently been developed. Those of Connor and Kendall [6] and Blanchet et al. [4] use dominated Coupling from the Past (domCFTP) to sample from the equilibrium distribution of the Kiefer-Wolfowitz workload vector for stable M /G/c and G I /G I /c queues respectively, using Random Assignment queues as dominating processes. In this note we answer a question posed by Connor and Kendall [6], by demonstrating how these algorithms may be modified in order to carry out domCFTP simultaneously for a range of values of c (the number of servers).",

author = "Connor, {Stephen Bryan}",

year = "2019",

month = sep,

day = "9",

language = "English",

journal = "ACM Transactions on Modeling and Computer Simulation",

issn = "1049-3301",

publisher = "ACM",

}

TY - JOUR

T1 - Omnithermal Perfect Simulation for Multi-server Queues

AU - Connor, Stephen Bryan

PY - 2019/9/9

Y1 - 2019/9/9

N2 - A number of perfect simulation algorithms for multi-server First Come First Served queues have recently been developed. Those of Connor and Kendall [6] and Blanchet et al. [4] use dominated Coupling from the Past (domCFTP) to sample from the equilibrium distribution of the Kiefer-Wolfowitz workload vector for stable M /G/c and G I /G I /c queues respectively, using Random Assignment queues as dominating processes. In this note we answer a question posed by Connor and Kendall [6], by demonstrating how these algorithms may be modified in order to carry out domCFTP simultaneously for a range of values of c (the number of servers).

AB - A number of perfect simulation algorithms for multi-server First Come First Served queues have recently been developed. Those of Connor and Kendall [6] and Blanchet et al. [4] use dominated Coupling from the Past (domCFTP) to sample from the equilibrium distribution of the Kiefer-Wolfowitz workload vector for stable M /G/c and G I /G I /c queues respectively, using Random Assignment queues as dominating processes. In this note we answer a question posed by Connor and Kendall [6], by demonstrating how these algorithms may be modified in order to carry out domCFTP simultaneously for a range of values of c (the number of servers).

M3 - Article

SN - 1049-3301

JO - ACM Transactions on Modeling and Computer Simulation

JF - ACM Transactions on Modeling and Computer Simulation

ER -