IDEAS home Printed from https://ideas.repec.org/a/eme/jrfpps/15265941011025206.html
   My bibliography  Save this article

On a class of renewal queueing and risk processes

Author

Listed:
  • K.K. Thampi
  • M.J. Jacob

Abstract

Purpose - The purpose of this paper is to investigate how queueing theory has been applied to derive results for a Sparre Andersen risk process for which the claim inter‐arrival distribution is hyper Erlang. Design/methodology/approach - The paper exploits the duality results between the queueing theory and risk processes to derive explicit expressions for the ultimate ruin probability and moments of time to ruin in this renewal risk model. Findings - This paper derives explicit expressions for the Laplace transforms of the idle/waiting time distribution inGI/HEr(ki,λi)/1 and its dual HEr(ki,λi)/G/1. As a consequence, an expression for the ultimate ruin probability is obtained in this model. The relationship between the time of ruin and busy period inM/G/1 queuing system is used to derive the expected time of ruin. Originality/value - The study of renewal risk process is mostly concentrated on Erlang distributed inter‐claim times. But the Erlang distributions are not dense in the space of all probability distributions and therefore, the paper cannot approximate an arbitrary distribution function by an Erlang one. To overcome this difficulty, the paper uses the hyper Erlang distributions, which can be used to approximate the distribution of any non‐negative random variable.

Suggested Citation

  • K.K. Thampi & M.J. Jacob, 2010. "On a class of renewal queueing and risk processes," Journal of Risk Finance, Emerald Group Publishing Limited, vol. 11(2), pages 204-220, March.
  • Handle: RePEc:eme:jrfpps:15265941011025206
    DOI: 10.1108/15265941011025206
    as

    Download full text from publisher

    File URL: https://www.emerald.com/insight/content/doi/10.1108/15265941011025206/full/html?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://www.emerald.com/insight/content/doi/10.1108/15265941011025206/full/pdf?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1108/15265941011025206?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.

    More about this item

    Keywords

    Queuing theory; Risk assessment;

    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:eme:jrfpps:15265941011025206. 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: Emerald Support (email available below). General contact details of provider: .

    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.