Skip to main content

Part of the book series: Applications of Mathematics ((SMAP,volume 15))

  • 214 Accesses

Abstract

In the preceding chapter we investigated storage models in which the net input process Y was of the form Y(t) = X(t) − t, X being a non-negative Lévy process. Although such an input would seem to be rather special, we found it to be appropriate for a wide variety of situations, in particular, for queues with first come, first served discipline as well as queues with priorities. However, there still remains the general case of the insurance risk problem and the simple queue in which the net input is of the form Y(t) = A(t) − D(t) with A, D two independent simple Poisson processes. In order to investigate these and further storage models we need to develop some new concepts concerning Lévy processes. Accordingly, let Y be a Levy process with the c.f.

$$ E{e^{i\omega Y\left( t \right)}} = {e^{ - t\phi \left( \omega \right)}}, $$
(1)

where φ(ω) is as given in Chapter 3, Section 2. Let us define the random variables

$$ T = \inf \left\{ {t:Y\left( t \right) > 0} \right\},\;\;\;\bar T = inf\left\{ {t:Y\left( t \right) < 0} \right\}. $$
(2)

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Fristedt, Bert (1974): Sample functions of stochastic processes with stationary independent increments. Advances in Probability 3, Marcel Dekker, New York.

    Google Scholar 

  • Gani, J. and Pyke, R. (1960): The content of a dam as the supremum of an infinitely divisible process. J. Math, and Mech. 9, 639–652.

    MathSciNet  MATH  Google Scholar 

  • Goldberg, H. M. (1977): Analysis of the earliest due date scheduling rule in queueing systems. Math. Opns. Res. 2, 145–154.

    Article  MATH  Google Scholar 

  • Grinstein, J. and Rubinovitch (1974): Queues with random service output: the case of Poisson arrivals. J. Appl. Prob. 11, 771–784.

    Article  MathSciNet  MATH  Google Scholar 

  • Greenwood, P. (1973): On Prabhu’s factorization of Levy generators. Z. Wahrscheinlichkeitstheorie verw. Geb. 27, 75–77.

    Article  MathSciNet  MATH  Google Scholar 

  • Hasofer, A. M. (1966a): The almost full dam with Poisson input. J. Roy. Statist. Soc. B 28, 329–335.

    MathSciNet  MATH  Google Scholar 

  • Hasofer, A. M. (1966b): The almost full dam with Poisson input: further results. J. Roy. Statist. Soc. B 28, 448–455.

    MathSciNet  MATH  Google Scholar 

  • Hooke, J. A. and Prabhu, N. U. (1971): Priority queues in heavy traffic. Opsearch 8, 1–9.

    MathSciNet  Google Scholar 

  • Jewell, W. S. (1967): Fluctuations of a renewal-reward process. J. Math. Anal. Appl. 19, 309–329.

    Article  MathSciNet  MATH  Google Scholar 

  • Kingman, J. F. C. (1972): Regenerative Phenomena. John Wiley, New York.

    MATH  Google Scholar 

  • Martins-Neto, A. F. and Wong, E. (1976): A martingale approach to queues. Stochastic Systems: Modeling, Identification and Optimization I (Rogers J.-B. Wets, ed.). North-Holland Publishing Company, Amsterdam.

    Google Scholar 

  • Prabhu, N. U. (1964): A waiting time process in the queue GI/M/1. Acta. Math. Acad. Sci. Hung. 15, 363–371.

    Article  MathSciNet  MATH  Google Scholar 

  • Prabhu, N. U. (1965): Queues and Inventories. John Wiley, New York.

    MATH  Google Scholar 

  • Prabhu, N. U. (1970a): The queue GI/M/1 with traffic intensity one. Studia Sci. Math. Hungar. 5, 89–96.

    MathSciNet  MATH  Google Scholar 

  • Prabhu, N. U. (1970b): Ladder variables for a continuous time stochastic process. Z. Wahrscheinlichketistheorie verw. Geb. 16, 157–164.

    Article  MathSciNet  MATH  Google Scholar 

  • Prabhu, N. U. (1972): Wiener-Hopf factorization for convolution semigroups. Z. Wahrscheinlichkeitstheorie verw. Geb. 23, 103–113.

    Article  MathSciNet  MATH  Google Scholar 

  • Prabhu, N. U. (1973): Recent research on the ruin problem of collective risk theory. Inventory Control and Water Storage (A. Prekopa, ed.). North-Holland Publishing Company, Amsterdam.

    Google Scholar 

  • Prabhu, N. U. (1976): Ladder sets and regenerative phenomena: further remarks and some applications. Sankhya 38A, 143–152.

    MathSciNet  Google Scholar 

  • Prabhu, N. U. and Rubinovitch, M. (1970): A regenerative phenomenon occurring in a storage model. J. Roy. Statist. Soc. B 32, 354–361.

    MathSciNet  MATH  Google Scholar 

  • Prabhu, N. U. and Rubinovitch, M. (1971): On a continuous time extension of Feller’s lemma. Z. Wahrscheinlichkeitstheorie verw. Geb. 17, 220–226.

    Article  MathSciNet  Google Scholar 

  • Prabhu, N. U. and Rubinovitch, M. (1973): Further results for ladder processes in continuous time. Stochastic Processes Appl. 1, 151–168.

    Article  MathSciNet  MATH  Google Scholar 

  • Rogozin, B. A. (1966): On the distribution of functions related to boundary problems for processes with independent increments. Theor. Probab. Appl. 11, 580–591.

    Article  MATH  Google Scholar 

  • Rubinovitch, M. (1971): Ladder phenomena in stochastic processes with stationary independent increments. Z. Wahrscheinlichkeitstheorie verw. Geb. 20, 58–74.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Prabhu, N.U. (1980). More Storage Models. In: Stochastic Storage Processes. Applications of Mathematics, vol 15. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-0113-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-0113-4_5

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4684-0115-8

  • Online ISBN: 978-1-4684-0113-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics