IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v113y2002i1p119-13210.1023-a1020957827834.html
   My bibliography  Save this article

Boundary Crossing for the Difference of Two Ordinary or Compound Poisson Processes

Author

Listed:
  • D. Perry
  • W. Stadje
  • S. Zacks

Abstract

We consider the lower boundary crossing problem for the difference of two independent compound Poisson processes. This problem arises in the busy period analysis of single-server queueing models with work removals. The Laplace transform of the crossing time is derived as the unique solution of an integral equation and is shown to be given by a Neumann series. In the case of ±1 jumps, corresponding to queues with deterministic service times and work removals, we obtain explicit results and an approximation useful for numerical purposes. We also treat upper boundaries and two-sided stopping times, which allows to derive the conditional distribution of the maximum workload up to time t, given the busy period is longer than t. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • D. Perry & W. Stadje & S. Zacks, 2002. "Boundary Crossing for the Difference of Two Ordinary or Compound Poisson Processes," Annals of Operations Research, Springer, vol. 113(1), pages 119-132, July.
    • Handle: RePEc:spr:annopr:v:113:y:2002:i:1:p:119-132:10.1023/a:1020957827834
    DOI: 10.1023/A:1020957827834
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1020957827834
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1020957827834?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.

    Citations

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


    Cited by:

    1. R. Lenin & S. Ramaswamy, 2015. "Performance analysis of wireless sensor networks using queuing networks," Annals of Operations Research, Springer, vol. 233(1), pages 237-261, October.
    2. Pierre-Olivier Goffard, 2019. "Fraud risk assessment within blockchain transactions," Working Papers hal-01716687, HAL.
    3. Gapeev, Pavel V. & Stoev, Yavor I., 2017. "On the Laplace transforms of the first exit times in one-dimensional non-affine jump–diffusion models," Statistics & Probability Letters, Elsevier, vol. 121(C), pages 152-162.

    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:113:y:2002:i:1:p:119-132:10.1023/a:1020957827834. 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: 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.