Exact buffer overflow calculations for queues via martingales

Søren Asmussen*, Manfred Jobmann, Hans Peter Schwefel

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

20 Citations (Scopus)

Abstract

Let τn be the first time a queueing process like the queue length or workload exceeds a level n. For the M/M/1 queue length process, the mean double struck E sugneτn and the Laplace transform double-struck E signe-Sτn is derived in closed form using a martingale introduced in Kella and Whitt (1992). For workload processes and more general systems like MAP/PH/1, we use a Markov additive extension given in Asmussen and Kella (2000) to derive sets of linear equations determining the same quantities. Numerical illustrations are presented in the framework of M/M/ 1 and MMPP/M/1 with an application to performance evaluation of telecommunication systems with long-range dependent properties in the packet arrival process. Different approximations that are obtained from asymptotic theory are compared with exact numerical results.

Original languageEnglish
JournalQueueing Systems
Volume42
Issue number1
Pages (from-to)63-90
Number of pages28
ISSN0257-0130
DOIs
Publication statusPublished - 1 Dec 2002
Externally publishedYes

Keywords

  • Exponential martingale
  • Extreme value theory
  • Lévy process
  • Local time
  • Markov-modulation
  • Martingale
  • Power tail
  • Queue length
  • Regenerative process
  • Wald martingale

Fingerprint

Dive into the research topics of 'Exact buffer overflow calculations for queues via martingales'. Together they form a unique fingerprint.

Cite this