Heavy-Traffic Analysis of the M/G/1 Queue With Priority Classes
AbstractAMS classifications: 60K25, 90B22.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 1998-102.
Date of creation: 1998
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
M=G=1 queue; priority; heavy-tailed service time distribution; regular variation; waiting time distribution; heavy-traffic limit theorem; heavy-traffic approximation;
This paper has been announced in the following NEP Reports:
- NEP-ALL-1999-03-08 (All new papers)
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.:
- Cohen, J. W., 1974. "Superimposed renewal processes and storage with gradual input," Stochastic Processes and their Applications, Elsevier, vol. 2(1), pages 31-57, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.