Affiliation:
1. Department of Mathematics, University of York, UK
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
GI
/
GI
/
c
queues, respectively, using Random Assignment queues as dominating processes. In this article, we answer a question posed by Connor and Kendall [6] by demonstrating how these algorithms may be modified to carry out domCFTP
simultaneously
for a range of values of
c
(the number of servers).
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,Modeling and Simulation
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献