Blocking probabilities in Erlang loss queues with advance reservation

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)

Abstract

We study the blocking probability in a continuous time loss queue, in which resources can be claimed a random time in advance. We identify classes of loss queues where the advance reservation results in increased or decreased blocking probabilities. The lower blocking probabilities are achieved because the system tends to favor short jobs. We provide analytical and numerical results to establish the connection between the system’s parameters and either an increase or decrease of blocking probabilities, compared to the system without reservation.
Original languageEnglish
Pages (from-to)187-196
Number of pages10
JournalStochastic models
Volume30
Issue number2
DOIs
Publication statusPublished - 2014

Keywords

  • MSC-68M20
  • MSC-60K25
  • Erlang loss queue
  • Advance reservation

Fingerprint Dive into the research topics of 'Blocking probabilities in Erlang loss queues with advance reservation'. Together they form a unique fingerprint.

  • Cite this