IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v293y2020i1d10.1007_s10479-019-03324-w.html
   My bibliography  Save this article

Excessive backlog probabilities of two parallel queues

Author

Listed:
  • Kamil Demirberk Ünlü

    (Ankara University
    Middle East Technical University)

  • Ali Devin Sezer

    (Middle East Technical University)

Abstract

Let X be the constrained random walk on $${\mathbb Z}_+^2$$ Z + 2 with increments (1, 0), $$(-1,0)$$ ( - 1 , 0 ) , (0, 1) and $$(0,-1)$$ ( 0 , - 1 ) ; X represents, at arrivals and service completions, the lengths of two queues (or two stacks in computer science applications) working in parallel whose service and interarrival times are exponentially distributed with arrival rates $$\lambda _i$$ λ i and service rates $$\mu _i$$ μ i , $$i=1,2$$ i = 1 , 2 ; we assume $$\lambda _i 0$$ x ( 1 ) > 0 , $$P_{(n-x_n(1),x_n(2))}( \tau

Suggested Citation

  • Kamil Demirberk Ünlü & Ali Devin Sezer, 2020. "Excessive backlog probabilities of two parallel queues," Annals of Operations Research, Springer, vol. 293(1), pages 141-174, October.
    • Handle: RePEc:spr:annopr:v:293:y:2020:i:1:d:10.1007_s10479-019-03324-w
    DOI: 10.1007/s10479-019-03324-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-019-03324-w
    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/s10479-019-03324-w?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. Ridder, Ad, 2009. "Importance sampling algorithms for first passage time probabilities in the infinite server queue," European Journal of Operational Research, Elsevier, vol. 199(1), pages 176-186, November.
    2. Masakiyo Miyazawa, 2009. "Tail Decay Rates in Double QBD Processes and Related Reflected Random Walks," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 547-575, August.
    3. Jose Blanchet, 2013. "Optimal Sampling of Overflow Paths in Jackson Networks," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 698-719, November.
    4. Dean, Thomas & Dupuis, Paul, 2009. "Splitting for rare event simulation: A large deviation approach to design and analysis," Stochastic Processes and their Applications, Elsevier, vol. 119(2), pages 562-587, February.
    5. Masakiyo Miyazawa, 2011. "Light tail asymptotics in multidimensional reflecting processes for queueing networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(2), pages 233-299, December.
    6. Sezer, Ali Devin, 2009. "Importance sampling for a Markov modulated queuing network," Stochastic Processes and their Applications, Elsevier, vol. 119(2), pages 491-517, February.
    7. P. T. de Boer & D. P. Kroese & R. Y. Rubinstein, 2004. "A Fast Cross-Entropy Method for Estimating Buffer Overflows in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 883-895, July.
    8. Masakiyo Miyazawa, 2011. "Rejoinder on: Light tail asymptotics in multidimensional reflecting processes for queueing networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(2), pages 313-316, December.
    9. Atar, Rami & Dupuis, Paul, 1999. "Large deviations and queueing networks: Methods for rate function identification," Stochastic Processes and their Applications, Elsevier, vol. 84(2), pages 255-296, December.
    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. Fatma Başoğlu Kabran & Ali Devin Sezer, 2022. "Approximation of the exit probability of a stable Markov modulated constrained random walk," Annals of Operations Research, Springer, vol. 310(2), pages 431-475, March.
    2. Toshihisa Ozawa, 2021. "Asymptotic properties of the occupation measure in a multidimensional skip-free Markov-modulated random walk," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 125-161, February.
    3. Toshihisa Ozawa & Masahiro Kobayashi, 2018. "Exact asymptotic formulae of the stationary distribution of a discrete-time two-dimensional QBD process," Queueing Systems: Theory and Applications, Springer, vol. 90(3), pages 351-403, December.
    4. Yanting Chen & Richard J. Boucherie & Jasper Goseling, 2020. "Necessary conditions for the compensation approach for a random walk in the quarter-plane," Queueing Systems: Theory and Applications, Springer, vol. 94(3), pages 257-277, April.
    5. Toshihisa Ozawa, 2022. "Tail asymptotics in any direction of the stationary distribution in a two-dimensional discrete-time QBD process," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 227-267, October.
    6. Yanting Chen & Richard J. Boucherie & Jasper Goseling, 2016. "Invariant measures and error bounds for random walks in the quarter-plane based on sums of geometric terms," Queueing Systems: Theory and Applications, Springer, vol. 84(1), pages 21-48, October.
    7. Yiqiang Q. Zhao, 2022. "The kernel method tail asymptotics analytic approach for stationary probabilities of two-dimensional queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(1), pages 95-131, February.
    8. Thomas Dean & Paul Dupuis, 2011. "The design and analysis of a generalized RESTART/DPR algorithm for rare event simulation," Annals of Operations Research, Springer, vol. 189(1), pages 63-102, September.
    9. Mihail Bazhba & Chang-Han Rhee & Bert Zwart, 2022. "Large deviations for stochastic fluid networks with Weibullian tails," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 25-52, October.
    10. Ioannis Dimitriou, 2022. "Stationary analysis of certain Markov-modulated reflected random walks in the quarter plane," Annals of Operations Research, Springer, vol. 310(2), pages 355-387, March.
    11. Ioannis Dimitriou, 2021. "On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency," Queueing Systems: Theory and Applications, Springer, vol. 98(1), pages 95-143, June.
    12. K.-P. Hui & N. Bean & M. Kraetzl & Dirk Kroese, 2005. "The Cross-Entropy Method for Network Reliability Estimation," Annals of Operations Research, Springer, vol. 134(1), pages 101-118, February.
    13. O. J. Boxma & E. J. Cahen & D. Koops & M. Mandjes, 2019. "Linear Stochastic Fluid Networks: Rare-Event Simulation and Markov Modulation," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 125-153, March.
    14. Loretta Mastroeni & Giuseppe D'Acquisto & Maurizio Naldi, 2014. "Evaluation of Credit Risk Under Correlated Defaults: The Cross-Entropy Simulation Approach," Departmental Working Papers of Economics - University 'Roma Tre' 0193, Department of Economics - University Roma Tre.
    15. Ad Ridder & Adam Shwartz, 2005. "Large deviations without principle: join the shortest queue," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 467-483, December.
    16. Ad Ridder & Adam Shwartz, 2005. "Large Deviations Methods and the Join-the-Shortest-Queue Model," Tinbergen Institute Discussion Papers 05-016/4, Tinbergen Institute.
    17. Kaynar, Bahar & Ridder, Ad, 2010. "The cross-entropy method with patching for rare-event simulation of large Markov chains," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1380-1397, December.
    18. Ad Ridder & Adam Shwartz, 2004. "Large Deviations without Principle: Join the Shortest Queue," Tinbergen Institute Discussion Papers 05-003/4, Tinbergen Institute.
    19. Atar, Rami & Shadmi, Yonatan, 2023. "Fluid limits for earliest-deadline-first networks," Stochastic Processes and their Applications, Elsevier, vol. 157(C), pages 279-307.
    20. Zdravko I. Botev & Pierre L’Ecuyer, 2020. "Sampling Conditionally on a Rare Event via Generalized Splitting," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 986-995, October.

    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:annopr:v:293:y:2020:i:1:d:10.1007_s10479-019-03324-w. 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.