IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v79y1999i2p265-286.html
   My bibliography  Save this article

Sampling at subexponential times, with queueing applications

Author

Listed:
  • Asmussen, Søren
  • Klüppelberg, Claudia
  • Sigman, Karl

Abstract

We study the tail asymptotics of the r.v. X(T) where {X(t)} is a stochastic process with a linear drift and satisfying some regularity conditions like a central limit theorem and a large deviations principle, and T is an independent r.v. with a subexponential distribution. We find that the tail of X(T) is sensitive to whether or not T has a heavier or lighter tail than a Weibull distribution with tail . This leads to two distinct cases, heavy tailed and moderately heavy tailed, but also some results for the classical light-tailed case are given. The results are applied via distributional Little's law to establish tail asymptotics for steady-state queue length in GI/GI/1 queues with subexponential service times. Further applications are given for queues with vacations, and M/G/1 busy periods.

Suggested Citation

  • Asmussen, Søren & Klüppelberg, Claudia & Sigman, Karl, 1999. "Sampling at subexponential times, with queueing applications," Stochastic Processes and their Applications, Elsevier, vol. 79(2), pages 265-286, February.
    • Handle: RePEc:eee:spapps:v:79:y:1999:i:2:p:265-286
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(98)00064-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Joseph Abate & Gagan L. Choudhury & Ward Whitt, 1995. "Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times," Operations Research, INFORMS, vol. 43(5), pages 885-901, October.
    2. Asmussen, Søren & Henriksen, Lotte Fløe & Klüppelberg, Claudia, 1994. "Large claims approximations for risk processes in a Markovian environment," Stochastic Processes and their Applications, Elsevier, vol. 54(1), pages 29-43, November.
    3. S. W. Fuhrmann & Robert B. Cooper, 1985. "Stochastic Decompositions in the M / G /1 Queue with Generalized Vacations," Operations Research, INFORMS, vol. 33(5), pages 1117-1129, October.
    4. Joseph Abate & Gagan L. Choudhury & Ward Whitt, 1996. "Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload," Operations Research, INFORMS, vol. 44(5), pages 758-763, October.
    5. Embrechts, P. & Veraverbeke, N., 1982. "Estimates for the probability of ruin with special emphasis on the possibility of large claims," Insurance: Mathematics and Economics, Elsevier, vol. 1(1), pages 55-72, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Robert, Christian Y. & Segers, Johan, 2008. "Tails of random sums of a heavy-tailed number of light-tailed terms," Insurance: Mathematics and Economics, Elsevier, vol. 43(1), pages 85-92, August.
    2. F. G. Badía & C. Sangüesa, 2017. "Log-Convexity of Counting Processes Evaluated at a Random end of Observation Time with Applications to Queueing Models," Methodology and Computing in Applied Probability, Springer, vol. 19(2), pages 647-664, June.
    3. Marc Lelarge, 2008. "Packet reordering in networks with heavy-tailed delays," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(2), pages 341-371, April.
    4. Hiroyuki Masuyama, 2016. "A sufficient condition for the subexponential asymptotics of GI/G/1-type Markov chains with queueing applications," Annals of Operations Research, Springer, vol. 247(1), pages 65-95, December.
    5. Predrag R. Jelenković & Petar Momčilović, 2004. "Large Deviations of Square Root Insensitive Random Sums," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 398-406, May.
    6. P. Jelenković & P. Momčilović, 2003. "Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 587-608, August.
    7. Bin Liu & Yiqiang Q. Zhao, 2020. "Tail asymptotics for the $$M_1,M_2/G_1,G_2/1$$ M 1 , M 2 / G 1 , G 2 / 1 retrial queue with non-preemptive priority," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 169-199, October.
    8. A. P. Zwart, 2001. "Tail Asymptotics for the Busy Period in the GI/G/1 Queue," Mathematics of Operations Research, INFORMS, vol. 26(3), pages 485-493, August.
    9. Bin Liu & Yiqiang Q. Zhao, 2022. "Tail Asymptotics for a Retrial Queue with Bernoulli Schedule," Mathematics, MDPI, vol. 10(15), pages 1-13, August.
    10. Evsey V. Morozov & Irina V. Peshkova & Alexander S. Rumyantsev, 2023. "Bounds and Maxima for the Workload in a Multiclass Orbit Queue," Mathematics, MDPI, vol. 11(3), pages 1-15, January.
    11. Bin Liu & Jie Min & Yiqiang Q. Zhao, 2023. "Refined tail asymptotic properties for the $$M^X/G/1$$ M X / G / 1 retrial queue," Queueing Systems: Theory and Applications, Springer, vol. 104(1), pages 65-105, June.
    12. Royi Jacobovic & Nikki Levering & Onno Boxma, 2023. "Externalities in the M/G/1 queue: LCFS-PR versus FCFS," Queueing Systems: Theory and Applications, Springer, vol. 104(3), pages 239-267, August.
    13. Baltrunas, A. & Daley, D. J. & Klüppelberg, C., 2004. "Tail behaviour of the busy period of a GI/GI/1 queue with subexponential service times," Stochastic Processes and their Applications, Elsevier, vol. 111(2), pages 237-258, June.
    14. Debicki, Krzystof & Zwart, Bert & Borst, Sem, 2004. "The supremum of a Gaussian process over a random interval," Statistics & Probability Letters, Elsevier, vol. 68(3), pages 221-234, July.

    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. Bart Steyaert & Sabine Wittevrongel & Herwig Bruneel, 2017. "Characterisation of the output process of a discrete-time GI / D / 1 queue, and its application to network performance," Annals of Operations Research, Springer, vol. 252(1), pages 175-190, May.
    2. So, Kut C. & Song, Jing-Sheng, 1998. "Price, delivery time guarantees and capacity selection," European Journal of Operational Research, Elsevier, vol. 111(1), pages 28-49, November.
    3. Jalili Marand, Ata & Li, Hongyan & Thorstenson, Anders, 2019. "Joint inventory control and pricing in a service-inventory system," International Journal of Production Economics, Elsevier, vol. 209(C), pages 78-91.
    4. Schlegel, Sabine, 1998. "Ruin probabilities in perturbed risk models," Insurance: Mathematics and Economics, Elsevier, vol. 22(1), pages 93-104, May.
    5. Søren Asmussen & Colm O'cinneide, 2002. "On the Tail of the Waiting Time in a Markov-Modulated M/G/1 Queue," Operations Research, INFORMS, vol. 50(3), pages 559-565, June.
    6. Gad Allon & Awi Federgruen, 2008. "Service Competition with General Queueing Facilities," Operations Research, INFORMS, vol. 56(4), pages 827-849, August.
    7. Asmussen, Søren & Klüppelberg, Claudia, 1996. "Large deviations results for subexponential tails, with applications to insurance risk," Stochastic Processes and their Applications, Elsevier, vol. 64(1), pages 103-125, November.
    8. Furrer, Hansjorg & Michna, Zbigniew & Weron, Aleksander, 1997. "Stable Lévy motion approximation in collective risk theory," Insurance: Mathematics and Economics, Elsevier, vol. 20(2), pages 97-114, September.
    9. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case," Economics Working Papers 314, Department of Economics and Business, Universitat Pompeu Fabra, revised Aug 1998.
    10. Grandell, Jan, 2000. "Simple approximations of ruin probabilities," Insurance: Mathematics and Economics, Elsevier, vol. 26(2-3), pages 157-173, May.
    11. S. Pitts, 1994. "Nonparametric estimation of compound distributions with applications in insurance," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 46(3), pages 537-555, September.
    12. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 306-330, May.
    13. Priyanka Kalita & Gautam Choudhury & Dharmaraja Selvamuthu, 2020. "Analysis of Single Server Queue with Modified Vacation Policy," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 511-553, June.
    14. Julien Trufin & Stéphane Loisel, 2013. "Ultimate ruin probability in discrete time with Bühlmann credibility premium adjustments," Post-Print hal-00426790, HAL.
    15. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.
    16. Yuen, Kam C. & Wang, Guojing & Ng, Kai W., 2004. "Ruin probabilities for a risk process with stochastic return on investments," Stochastic Processes and their Applications, Elsevier, vol. 110(2), pages 259-274, April.
    17. Jalili Marand, Ata & Tang, Ou & Li, Hongyan, 2019. "Quandary of service logistics: Fast or reliable?," European Journal of Operational Research, Elsevier, vol. 275(3), pages 983-996.
    18. Yi Peng & Jinbiao Wu, 2020. "A Lévy-Driven Stochastic Queueing System with Server Breakdowns and Vacations," Mathematics, MDPI, vol. 8(8), pages 1-12, July.
    19. Jianpei Wen & Hanyu Jiang & Jie Song, 2019. "A Stochastic Queueing Model for Capacity Allocation in the Hierarchical Healthcare Delivery System," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(01), pages 1-24, February.
    20. Jianjun Li & Liwei Liu & Tao Jiang, 2018. "Analysis of an M/G/1 queue with vacations and multiple phases of operation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 51-72, February.

    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:eee:spapps:v:79:y:1999:i:2:p:265-286. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.