Simulation of queueing systems with many stations and of queueing networks using copulas
In this paper we will generate queueing systems with c stations where the inter-arrival time and the c service times depend through a c+1 copula C. We will consider two models: first when the customer does not know the order of service times for the free service channels (he/she chooses the service channel randomly), and the second when he/she knows this order (he/she chooses the fastest free service channel). The marginals can be exponential, Erlang or hyper-exponential.
|Date of creation:||Apr 2010|
|Date of revision:||Sep 2010|
|Publication status:||Published in Scientific Journal Mathematical Modeling in Civil Engineering 3.6(2010): pp. 72-86|
|Contact details of provider:|| Postal: |
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Ciuiu, Daniel, 2007. "Gordon and Newell queueing networks and copulas," MPRA Paper 15769, University Library of Munich, Germany, revised May 2009.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:27018. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht)
If references are entirely missing, you can add them using this form.