Marginal Productivity Index Policies For Scheduling A Multiclass Delay-/Loss-Sensitive Queue
AbstractWe address the problem of scheduling a multiclass M/M/1 queue with a finite dedicated buffer for each class. Some classes are delay-sensitive, modeling real-time traffic (e.g. voice, video), whereas others are loss-sensitive, modeling nonreal-time traffic (e.g. data). Different levels of tolerance to delay and loss are modeled by appropriate linear holding cost and rejection cost rates. The goal is to design well-grounded and tractable scheduling policies which nearly minimize the discounted or long-run average expected cost objective. We develop new dynamic index policies, prescribing to give higher service priority to classes with larger index values, where the priority index of a class measures the marginal productivity of work at its current state. To construct the indices, we deploy the theory of marginal productivity indices (MPIs) and PCLindexability we have introduced in recent work, and further introduce significant extensions to such theory motivated by phenomena observed in the model of concern. The MPI policies are shown to furnish new, insightful structural results, and to exhibit a nearly optimal performance in a computational study.
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 Universidad Carlos III, Departamento de Estadística y Econometría in its series Statistics and Econometrics Working Papers with number ws053906.
Date of creation: Jun 2005
Date of revision:
Contact details of provider:
Postal: C/ Madrid, 126 - 28903 GETAFE (MADRID)
Web page: http://www.uc3m.es/uc3m/dpto/DEE/departamento.html
More information through EDIRC
This paper has been announced in the following NEP Reports:
- NEP-ALL-2005-06-14 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statistics
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
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.