Show simple item record

dc.contributor.authorAyesta U.
dc.contributor.authorErausquin M.
dc.contributor.authorJacko P.
dc.date.accessioned2017-02-21T08:11:14Z
dc.date.available2017-02-21T08:11:14Z
dc.date.issued2011-12-31
dc.identifier.isbn978-1-45-771816-8
dc.identifier.urihttp://hdl.handle.net/20.500.11824/381
dc.description.abstractWe investigate the problem of sharing the resources of a single server with time-varying capacity with the objective of minimizing the mean delay. We formulate the resource allocation problem as a Markov Decision Process. The problem is not solvable analytically in full generality, and we thus set out to obtain an approximate solution. In our main contribution, we extend the framework of multi-armed bandits to develop a heuristic solution of index type. At every given time, the heuristic assigns an index to every user that depends solely on its current state, and serves the user with highest current index value. We show that in the case of constant capacity, the heuristic policy is equivalent to the so-called Gittins index rule, which is known to be optimal under the assumption of constant capacity. © 2011 IEEE.
dc.formatapplication/pdf
dc.languageeng
dc.publisher2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/
dc.titleResource-sharing in a single server with time-varying capacity
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.identifier.doi10.1109/Allerton.2011.6120192
dc.relation.publisherversionhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84856087488&doi=10.1109%2fAllerton.2011.6120192&partnerID=40&md5=f2df432631289b762bee104e84b3e2bc


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess