Games and Queues
We consider scheduling in distributed systems from a game theoretic point view while taking into account queuing theory methodologies. In this approach no one knows the global state of the system while users try to maximize their utility. Since the performance of such a blind scheduler is worse than the optimal, it induces users to employ strategies to improve their own utilization of the system. One such strategy is that of restarting a request if it is not satisfied in a given time. Since we assume users as non-cooperative and selfish, the problem is that of studying the characteristic of the Nash equilibrium in a large distributed system with no omniscient controls. We study the problem through computer experiments and analytical approaches. We obtain exact solutions in situations delimited by two extremes: one in which users never restart an initial request, and another one in which the user's requests are restarted infinitely often. Users can switch between these two behaviors. When the system load is below certain threshold, it is always better off to be impatient, and when the system load is higher than some threshold, it is always better to be patient. Between them there exists a homogeneous Nash equilibrium with non-trivial properties.
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||11 Aug 2004|
|Date of revision:|
|Contact details of provider:|| Web page: http://comp-econ.org/|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf4:336. 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: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.