Article thumbnail

On the cycle maximum of mountains, dams and queues

By O.J. Boxma and D. Perry

Abstract

We determine the distribution of the maximum level of the workload in some queueing, dam and storage processes. The models under consideration are the following. (i) The Markov mountain: a storage or dam model that alternates between exponentially distributed ON and OFF periods. The buffer content increases (decreases) at some state-dependent rate when ON (OFF). (ii) The semi-Markov mountain: as (i), but with generally distributed ON periods. (iii) The M=G=1 queue with various forms of customer impatience

Publisher: Eurandom
Year: 2009
DOI identifier: 10.1080/03610910902936232
OAI identifier:
Provided by: NARCIS
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.loc.gov/mods/v3 (external link)
  • https://pure.tue.nl/ws/oai (external link)
  • https://research.tue.nl/nl/pub... (external link)
  • https://pure.tue.nl/ws/files/3... (external link)
  • https://research.tue.nl/nl/pub... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles