Exponential bounds for excess probabilities in systems with a finite capacity
AbstractIn this paper we study GI/G/I queueing systems with finite capacity. Our main objective is to find exponential bounds for the limiting probability that an arriving customer causes an excess of the system capacity. The derivation of these bounds is based on a comparison of the finite and infinite capacity systems.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Stochastic Processes and their Applications.
Volume (Year): 24 (1987)
Issue (Month): 1 (February)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Dijk, N.M. van, 1987. "Queueing systems with restricted workload : an explicit and recursive expression," Serie Research Memoranda 0050, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.