IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v95y2020i3d10.1007_s11134-020-09658-8.html
   My bibliography  Save this article

Stein’s method for diffusive limits of queueing processes

Author

Listed:
  • Eustache Besançon

    (Institut polytechnique de Paris)

  • Laurent Decreusefond

    (Institut polytechnique de Paris)

  • Pascal Moyal

    (Université de Lorraine)

Abstract

Donsker’s theorem is perhaps the most famous invariance principle result for Markov processes. It states that, when properly normalized, a random walk behaves asymptotically like a Brownian motion. This approach can be extended to general Markov processes whose driving parameters are taken to a limit, which can lead to insightful results in contexts like large distributed systems or queueing networks. The purpose of this paper is to assess the rate of convergence in these so-called diffusion approximations, in a queueing context. To this end, we extend the functional Stein method, introduced for the Brownian approximation of Poisson processes, to two simple examples: the single-server queue and the infinite-server queue. By doing so, we complete the recent applications of Stein’s method to queueing systems, with results concerning the whole trajectory of the considered process, rather than its stationary distribution.

Suggested Citation

  • Eustache Besançon & Laurent Decreusefond & Pascal Moyal, 2020. "Stein’s method for diffusive limits of queueing processes," Queueing Systems: Theory and Applications, Springer, vol. 95(3), pages 173-201, August.
    • Handle: RePEc:spr:queues:v:95:y:2020:i:3:d:10.1007_s11134-020-09658-8
    DOI: 10.1007/s11134-020-09658-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-020-09658-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-020-09658-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:95:y:2020:i:3:d:10.1007_s11134-020-09658-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.