IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v105y2023i3d10.1007_s11134-023-09893-9.html
   My bibliography  Save this article

Reflected Brownian motion with drift in a wedge

Author

Listed:
  • Peter Lakner

    (New York University)

  • Ziran Liu

    (New York University)

  • Josh Reed

    (New York University)

Abstract

We study reflecting Brownian motion with drift constrained to a wedge in the plane. Our first set of results provides necessary and sufficient conditions for existence and uniqueness of a solution to the corresponding submartingale problem with drift, and show that its solution possesses the Markov and Feller properties. Next, we study a version of the problem with absorption at the vertex of the wedge. In this case, we provide a condition for existence and uniqueness of a solution to the problem and some results on the probability of the vertex being reached.

Suggested Citation

  • Peter Lakner & Ziran Liu & Josh Reed, 2023. "Reflected Brownian motion with drift in a wedge," Queueing Systems: Theory and Applications, Springer, vol. 105(3), pages 233-270, December.
    • Handle: RePEc:spr:queues:v:105:y:2023:i:3:d:10.1007_s11134-023-09893-9
    DOI: 10.1007/s11134-023-09893-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-023-09893-9
    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-023-09893-9?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.

    References listed on IDEAS

    as
    1. Martin I. Reiman, 1984. "Open Queueing Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 441-458, August.
    2. Sandro Franceschi & Kilian Raschel, 2022. "A dual skew symmetry for transient reflected Brownian motion in an orthant," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 123-141, October.
    3. William P. Peterson, 1991. "A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 90-118, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    2. Ick-Hyun Nam, 2001. "Dynamic Scheduling for a Flexible Processing Network," Operations Research, INFORMS, vol. 49(2), pages 305-315, April.
    3. David Lipshutz & Kavita Ramanan, 2021. "Sensitivity Analysis for the Stationary Distribution of Reflected Brownian Motion in a Convex Polyhedral Cone," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 524-558, May.
    4. Sandro Franceschi & Irina Kourkova & Maxence Petit, 2024. "Asymptotics for the Green’s functions of a transient reflected Brownian motion in a wedge," Queueing Systems: Theory and Applications, Springer, vol. 108(3), pages 321-382, December.
    5. Martin I. Reiman & Lawrence M. Wein, 1999. "Heavy Traffic Analysis of Polling Systems in Tandem," Operations Research, INFORMS, vol. 47(4), pages 524-534, August.
    6. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    7. Hong Chen & Xinyang Shen & David D. Yao, 2002. "Brownian Approximations of Multiclass Open-Queueing Networks," Operations Research, INFORMS, vol. 50(6), pages 1032-1049, December.
    8. Amarjit Budhiraja & Jiang Chen & Sylvain Rubenthaler, 2014. "A Numerical Scheme for Invariant Distributions of Constrained Diffusions," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 262-289, May.
    9. Saulius Minkevičius & Igor Katin & Joana Katina & Irina Vinogradova-Zinkevič, 2021. "On Little’s Formula in Multiphase Queues," Mathematics, MDPI, vol. 9(18), pages 1-15, September.
    10. Mor Armony & Constantinos Maglaras, 2004. "On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design," Operations Research, INFORMS, vol. 52(2), pages 271-292, April.
    11. Saulius Minkevičius & Edvinas Greičius, 2019. "Heavy Traffic Limits for the Extreme Waiting Time in Multi-phase Queueing Systems," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 109-124, March.
    12. Biswas, Anup & Budhiraja, Amarjit, 2011. "Exit time and invariant measure asymptotics for small noise constrained diffusions," Stochastic Processes and their Applications, Elsevier, vol. 121(5), pages 899-924.
    13. Avi Mandelbaum & Kavita Ramanan, 2010. "Directional Derivatives of Oblique Reflection Maps," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 527-558, August.
    14. Yamada, Keigo, 1999. "Two limit theorems for queueing systems around the convergence of stochastic integrals with respect to renewal processes," Stochastic Processes and their Applications, Elsevier, vol. 80(1), pages 103-128, March.
    15. Ward Whitt & Wei You, 2020. "Heavy-traffic limits for stationary network flows," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 53-68, June.
    16. Yongjiang Guo & Yunan Liu & Renhu Pei, 2018. "Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback," Annals of Operations Research, Springer, vol. 264(1), pages 157-191, May.
    17. Otis B. Jennings, 2008. "Heavy-Traffic Limits of Queueing Networks with Polling Stations: Brownian Motion in a Wedge," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 12-35, February.
    18. Dimitris Bertsimas & David Gamarnik & Alexander Anatoliy Rikun, 2011. "Performance Analysis of Queueing Networks via Robust Optimization," Operations Research, INFORMS, vol. 59(2), pages 455-466, April.
    19. Martin I. Reiman & Rodrigo Rubio & Lawrence M. Wein, 1999. "Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem," Transportation Science, INFORMS, vol. 33(4), pages 361-380, November.
    20. Ernst, Philip A. & Franceschi, Sandro & Huang, Dongzhou, 2021. "Escape and absorption probabilities for obliquely reflected Brownian motion in a quadrant," Stochastic Processes and their Applications, Elsevier, vol. 142(C), pages 634-670.

    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:105:y:2023:i:3:d:10.1007_s11134-023-09893-9. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.