Show simple item record

hal.structure.identifierQuality control and dynamic reliability [CQFD]
hal.structure.identifierBasque Center for Applied Mathematics [BCAM]
dc.contributor.authorANSELMI, Jonatha
hal.structure.identifierMiddleware efficiently scalable [MESCAL]
dc.contributor.authorGAUJAL, Bruno
hal.structure.identifierBasque Center for Applied Mathematics [BCAM]
dc.contributor.authorNESTI, Tommaso
dc.date.accessioned2024-04-04T03:19:36Z
dc.date.available2024-04-04T03:19:36Z
dc.date.issued2015-12-01
dc.identifier.issn1946-5238
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/194522
dc.description.abstractEnWe consider a queueing system composed of a dispatcher that routes deterministically jobs to a set of non-observable queues working in parallel. In this setting, the fundamental problem is which policy should the dispatcher implement to minimize the stationary mean waiting time of the incoming jobs. We present a structural property that holds in the classic scaling of the system where the network demand (arrival rate of jobs) grows proportionally with the number of queues. Assuming that each queue of type r is replicated k times, we consider a set of policies that are periodic with period k r pr and such that exactly pr jobs are sent in a period to each queue of type r. When k → ∞, our main result shows that all the policies in this set are equivalent, in the sense that they yield the same mean stationary waiting time, and optimal, in the sense that no other policy having the same aggregate arrival rate to all queues of a given type can do better in minimizing the stationary mean waiting time. This property holds in a strong probabilistic sense. Furthermore, the limiting mean waiting time achieved by our policies is a convex function of the arrival rate in each queue, which facilitates the development of a further optimization aimed at solving the fundamental problem above for large systems.
dc.language.isoen
dc.publisherINFORMS Applied Probability Society
dc.title.enControl of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies
dc.typeArticle de revue
dc.identifier.doi10.1214/14-SSY146
dc.subject.halMathématiques [math]/Probabilités [math.PR]
dc.subject.halInformatique [cs]/Performance et fiabilité [cs.PF]
bordeaux.journalStochastic Systems
bordeaux.volume5
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.issue1
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-01102936
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01102936v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Stochastic%20Systems&rft.date=2015-12-01&rft.volume=5&rft.issue=1&rft.eissn=1946-5238&rft.issn=1946-5238&rft.au=ANSELMI,%20Jonatha&GAUJAL,%20Bruno&NESTI,%20Tommaso&rft.genre=article


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