CaltechAUTHORS
  A Caltech Library Service

Dispatching to incentivize fast service in multi-server queues

Doroudi, Sherwin and Gopalakrishnan, Ragavendran and Wierman, Adam (2011) Dispatching to incentivize fast service in multi-server queues. Performance Evaluation Review, 39 (3). pp. 43-45. ISSN 0163-5999. https://resolver.caltech.edu/CaltechAUTHORS:20120521-101935284

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20120521-101935284

Abstract

As a field, queueing theory predominantly assumes that the arrival rate of jobs and the system parameters, e.g., service rates, are fixed exogenously, and then proceeds to design and analyze scheduling policies that provide efficient performance, e.g., small response time (sojourn time). However, in reality, the arrival rate and/or service rate may depend on the scheduling and, more generally, the performance of the system. For example, if arrivals are strategic then a decrease in the mean response time due to improved scheduling may result in an increase in the arrival rate.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1145/2160803.2160855DOIUNSPECIFIED
http://dl.acm.org/citation.cfm?doid=2160803.2160855PublisherUNSPECIFIED
Additional Information:© 2011 ACM.
Issue or Number:3
Record Number:CaltechAUTHORS:20120521-101935284
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20120521-101935284
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:31565
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:21 May 2012 17:53
Last Modified:03 Oct 2019 03:52

Repository Staff Only: item control page