Skip to main content
Log in

Contributions to the theory of first‐exit times of some compound processes in queueing theory

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider compound processes that are linear with constant slope between i.i.d. jumps at time points forming a renewal process. These processes are basic in queueing, dam and risk theory. For positive and for negative slope we derive the distribution of the first crossing time of a prespecified level. The related problem of busy periods of single‐server queueing systems is also studied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S.F.L. Gallot, Absorption and first-passage times for a compound Poisson process in a general upper boundary, J. Appl. Probab. 4 (1993) 835-850.

    Article  Google Scholar 

  2. S. Karlin and H. Taylor, A Second Course in Stochastic Processes (Academic Press, New York, 1981).

    Google Scholar 

  3. P. Picard and C. Lef'evre, First crossing of basic counting processes with lower nonlinear boundaries: A unified approach through pseudopolynomials (I), Adv. in Appl. Probab. 28 (1996) 853-876.

    Article  Google Scholar 

  4. N.U. Prabhu, Stochastic Storage Processes: Queues, Inventories, and Dams (Springer, Berlin, 1980).

    Google Scholar 

  5. S. Zacks, D. Perry, D. Bshouty and S. Bar-Lev, Distributions of stopping times for compound Poisson processes with positive jumps and linear boundaries, Stochastic Models 15 (1989) 89-101.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Perry, D., Stadje, W. & Zacks, S. Contributions to the theory of first‐exit times of some compound processes in queueing theory. Queueing Systems 33, 369–379 (1999). https://doi.org/10.1023/A:1019140616021

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019140616021

Navigation