Efficiency of simulation in monotone hyper-stable queueing networks
| hal.structure.identifier | Quality control and dynamic reliability [CQFD] | |
| hal.structure.identifier | Basque Center for Applied Mathematics [BCAM] | |
| dc.contributor.author | ANSELMI, Jonatha | |
| hal.structure.identifier | Middleware efficiently scalable [MESCAL] | |
| dc.contributor.author | GAUJAL, Bruno | |
| dc.date.accessioned | 2024-04-04T03:19:35Z | |
| dc.date.available | 2024-04-04T03:19:35Z | |
| dc.date.issued | 2014-01-01 | |
| dc.identifier.issn | 0257-0130 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/194521 | |
| dc.description.abstractEn | We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficiency of sampling from their stationary distribution. In the context of exact sampling, the monotonicity structure of JQNs ensures that such efficiency is of the order of the coupling time (or meeting time) of two extremal sample paths. In the context of approximate sampling, it is given by the mixing time. Under a condition on the drift of the stochastic process underlying a JQN, which we call hyper-stability, in our main result we show that the coupling time is polynomial in both the number of queues and buffer sizes. Then, we use this result to show that the mixing time of JQNs behaves similarly up to a given precision threshold. Our proof relies on a recursive formula relating the coupling times of trajectories that start from network states having 'distance one', and it can be used to analyze the coupling and mixing times of other Markovian networks, provided that they are monotone. An illustrative example is shown in the context of JQNs with blocking mechanisms. | |
| dc.language.iso | en | |
| dc.publisher | Springer Verlag | |
| dc.title.en | Efficiency of simulation in monotone hyper-stable queueing networks | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1007/s11134-013-9357-7 | |
| dc.subject.hal | Mathématiques [math]/Probabilités [math.PR] | |
| dc.subject.hal | Informatique [cs]/Performance et fiabilité [cs.PF] | |
| bordeaux.journal | Queueing Systems | |
| bordeaux.page | 51-72 | |
| bordeaux.volume | 76 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 1 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01102977 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01102977v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Queueing%20Systems&rft.date=2014-01-01&rft.volume=76&rft.issue=1&rft.spage=51-72&rft.epage=51-72&rft.eissn=0257-0130&rft.issn=0257-0130&rft.au=ANSELMI,%20Jonatha&GAUJAL,%20Bruno&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||