Queueing systems fed by many exponential on-off sources: An infinite-intersection approach

Michael Mandjes, Petteri Mannersalo (Corresponding Author)

Research output: Contribution to journalArticleScientificpeer-review

5 Citations (Scopus)

Abstract

In queueing theory, an important class of events can be written as ‘infinite intersections’. For instance, in a queue with constant service rate c, busy periods starting at 0 and exceeding L > 0 are determined by the intersection of the events ⋂t∈[0,L]{Q0=0,At>ct} , i.e., queue Q t is empty at 0 and for all t∊ [0, L] the amount of traffic A t arriving in [0,t) exceeds the server capacity. Also the event of exceeding some predefined threshold in a tandem queue, or a priority queue, can be written in terms of this kind of infinite intersections. This paper studies the probability of such infinite intersections in queueing systems fed by a large number n of i.i.d. traffic sources (the so-called ‘many-sources regime’). If the sources are of the exponential on-off type, and the queueing resources are scaled proportional to n, the probabilities under consideration decay exponentially; we explicitly characterize the corresponding decay rate. The techniques used stem from large deviations theory (particularly sample-path large deviations).
Original languageEnglish
Pages (from-to)5-20
JournalQueueing Systems
Volume54
Issue number1
DOIs
Publication statusPublished - 2006
MoE publication typeA1 Journal article-refereed

Fingerprint

Queueing theory
Servers
Queueing system
Queue
Large deviations
Decay
Queueing
Resources

Keywords

  • sample-path large deviations
  • on-off processes
  • busy period
  • tandem queue
  • priority queue
  • queueing theory

Cite this

Mandjes, Michael ; Mannersalo, Petteri. / Queueing systems fed by many exponential on-off sources : An infinite-intersection approach. In: Queueing Systems. 2006 ; Vol. 54, No. 1. pp. 5-20.
@article{d91b53143bbb429593be20bff60c35c9,
title = "Queueing systems fed by many exponential on-off sources: An infinite-intersection approach",
abstract = "In queueing theory, an important class of events can be written as ‘infinite intersections’. For instance, in a queue with constant service rate c, busy periods starting at 0 and exceeding L > 0 are determined by the intersection of the events ⋂t∈[0,L]{Q0=0,At>ct} , i.e., queue Q t is empty at 0 and for all t∊ [0, L] the amount of traffic A t arriving in [0,t) exceeds the server capacity. Also the event of exceeding some predefined threshold in a tandem queue, or a priority queue, can be written in terms of this kind of infinite intersections. This paper studies the probability of such infinite intersections in queueing systems fed by a large number n of i.i.d. traffic sources (the so-called ‘many-sources regime’). If the sources are of the exponential on-off type, and the queueing resources are scaled proportional to n, the probabilities under consideration decay exponentially; we explicitly characterize the corresponding decay rate. The techniques used stem from large deviations theory (particularly sample-path large deviations).",
keywords = "sample-path large deviations, on-off processes, busy period, tandem queue, priority queue, queueing theory",
author = "Michael Mandjes and Petteri Mannersalo",
year = "2006",
doi = "10.1007/s11134-006-7781-7",
language = "English",
volume = "54",
pages = "5--20",
journal = "Queueing Systems",
issn = "0257-0130",
publisher = "Springer",
number = "1",

}

Queueing systems fed by many exponential on-off sources : An infinite-intersection approach. / Mandjes, Michael; Mannersalo, Petteri (Corresponding Author).

In: Queueing Systems, Vol. 54, No. 1, 2006, p. 5-20.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Queueing systems fed by many exponential on-off sources

T2 - An infinite-intersection approach

AU - Mandjes, Michael

AU - Mannersalo, Petteri

PY - 2006

Y1 - 2006

N2 - In queueing theory, an important class of events can be written as ‘infinite intersections’. For instance, in a queue with constant service rate c, busy periods starting at 0 and exceeding L > 0 are determined by the intersection of the events ⋂t∈[0,L]{Q0=0,At>ct} , i.e., queue Q t is empty at 0 and for all t∊ [0, L] the amount of traffic A t arriving in [0,t) exceeds the server capacity. Also the event of exceeding some predefined threshold in a tandem queue, or a priority queue, can be written in terms of this kind of infinite intersections. This paper studies the probability of such infinite intersections in queueing systems fed by a large number n of i.i.d. traffic sources (the so-called ‘many-sources regime’). If the sources are of the exponential on-off type, and the queueing resources are scaled proportional to n, the probabilities under consideration decay exponentially; we explicitly characterize the corresponding decay rate. The techniques used stem from large deviations theory (particularly sample-path large deviations).

AB - In queueing theory, an important class of events can be written as ‘infinite intersections’. For instance, in a queue with constant service rate c, busy periods starting at 0 and exceeding L > 0 are determined by the intersection of the events ⋂t∈[0,L]{Q0=0,At>ct} , i.e., queue Q t is empty at 0 and for all t∊ [0, L] the amount of traffic A t arriving in [0,t) exceeds the server capacity. Also the event of exceeding some predefined threshold in a tandem queue, or a priority queue, can be written in terms of this kind of infinite intersections. This paper studies the probability of such infinite intersections in queueing systems fed by a large number n of i.i.d. traffic sources (the so-called ‘many-sources regime’). If the sources are of the exponential on-off type, and the queueing resources are scaled proportional to n, the probabilities under consideration decay exponentially; we explicitly characterize the corresponding decay rate. The techniques used stem from large deviations theory (particularly sample-path large deviations).

KW - sample-path large deviations

KW - on-off processes

KW - busy period

KW - tandem queue

KW - priority queue

KW - queueing theory

U2 - 10.1007/s11134-006-7781-7

DO - 10.1007/s11134-006-7781-7

M3 - Article

VL - 54

SP - 5

EP - 20

JO - Queueing Systems

JF - Queueing Systems

SN - 0257-0130

IS - 1

ER -