IDEAS home Printed from https://ideas.repec.org/p/cte/wsrepe/ws080402.html
   My bibliography  Save this paper

Inference for double Pareto lognormal queues with applications

Author

Listed:
  • Ramírez Cobo, Josefa
  • Wilson, Simon P.

Abstract

In this article we describe a method for carrying out Bayesian inference for the double Pareto lognormal (dPlN) distribution which has recently been proposed as a model for heavy-tailed phenomena. We apply our approach to inference for the dPlN/M/1 and M/dPlN/1 queueing systems. These systems cannot be analyzed using standard techniques due to the fact that the dPlN distribution does not posses a Laplace transform in closed form. This difficulty is overcome using some recent approximations for the Laplace transform for the Pareto/M/1 system. Our procedure is illustrated with applications in internet traffic analysis and risk theory.

Suggested Citation

  • Ramírez Cobo, Josefa & Wilson, Simon P., 2008. "Inference for double Pareto lognormal queues with applications," DES - Working Papers. Statistics and Econometrics. WS ws080402, Universidad Carlos III de Madrid. Departamento de Estadística.
    • Handle: RePEc:cte:wsrepe:ws080402
    as

    Download full text from publisher

    File URL: https://e-archivo.uc3m.es/rest/api/core/bitstreams/136326d9-8b1f-4f62-b1dc-48cb4df62387/content
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. John F. Shortle & Martin J. Fischer & Percy H. Brill, 2007. "Waiting-Time Distribution of M/D N /1 Queues Through Numerical Laplace Inversion," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 112-120, February.
    2. repec:cte:wsrepe:ws046917 is not listed on IDEAS
    3. Carl M. Harris & William G. Marchal, 1998. "Distribution Estimation Using Laplace Transforms," INFORMS Journal on Computing, INFORMS, vol. 10(4), pages 448-458, November.
    4. John F. Shortle & Percy H. Brill & Martin J. Fischer & Donald Gross & Denise M. B. Masi, 2004. "An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 152-161, May.
    5. Carl M. Harris & Percy H. Brill & Martin J. Fischer, 2000. "Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 261-271, November.
    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. Kaiqi Yu & Mei-Ling Huang & Percy H. Brill, 2012. "An Algorithm for Fitting Heavy-Tailed Distributions via Generalized Hyperexponentials," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 42-52, February.
    2. Amir Ahmadi-Javid & Pooya Hoseinpour, 2022. "Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2621-2633, September.
    3. John F. Shortle & Martin J. Fischer & Percy H. Brill, 2007. "Waiting-Time Distribution of M/D N /1 Queues Through Numerical Laplace Inversion," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 112-120, February.
    4. John F. Shortle & Percy H. Brill & Martin J. Fischer & Donald Gross & Denise M. B. Masi, 2004. "An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 152-161, May.
    5. F. P. Barbhuiya & U. C. Gupta, 2019. "Discrete-time queue with batch renewal input and random serving capacity rule: $$GI^X/ Geo^Y/1$$ G I X / G e o Y / 1," Queueing Systems: Theory and Applications, Springer, vol. 91(3), pages 347-365, April.
    6. James J. Kim & Douglas G. Down & Mohan Chaudhry & Abhijit Datta Banik, 2022. "Difference Equations Approach for Multi-Server Queueing Models with Removable Servers," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1297-1321, September.
    7. Carl M. Harris & Percy H. Brill & Martin J. Fischer, 2000. "Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 261-271, November.
    8. M. L. Chaudhry & A. D. Banik & A. Pacheco, 2017. "A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: $$ GI ^{[X]}/C$$ G I [ X ] / C - $$ MSP /1/\infty $$ M S P / 1 / ∞," Annals of Operations Research, Springer, vol. 252(1), pages 135-173, May.
    9. Ward Whitt, 1999. "Partitioning Customers into Service Groups," Management Science, INFORMS, vol. 45(11), pages 1579-1592, November.
    10. Steve Derkic & James E. Stafford, 2002. "Symbolic Computation of Moments in Priority Queues," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 261-277, August.
    11. A. D. Banik & M. L. Chaudhry, 2017. "Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP / G /1/ N With or Without Vacation(s)," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 140-151, February.
    12. Jim (Junmin) Shi & Michael N. Katehakis & Benjamin Melamed & Yusen Xia, 2014. "Production-Inventory Systems with Lost Sales and Compound Poisson Demands," Operations Research, INFORMS, vol. 62(5), pages 1048-1063, October.
    13. J. J. Kim & M. L. Chaudhry & V. Goswami & A. D. Banik, 2021. "A New and Pragmatic Approach to the GIX/Geo/c/N Queues Using Roots," Methodology and Computing in Applied Probability, Springer, vol. 23(1), pages 273-289, March.

    More about this item

    Keywords

    Heavy tails;

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:cte:wsrepe:ws080402. 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: Ana Poveda (email available below). General contact details of provider: http://portal.uc3m.es/portal/page/portal/dpto_estadistica .

    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.