Markov-modulated finite-source queueing models in evaluation of computer and communication systems (Q597000): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Asymptotic methods in reliability theory: a review / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rare events in queueing systems -- A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite birth-and-death models in randomly changing environments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4840160 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819811 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5690361 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4514023 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0895-7177(03)90080-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2098695583 / rank | |||
Normal rank |
Latest revision as of 10:28, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Markov-modulated finite-source queueing models in evaluation of computer and communication systems |
scientific article |
Statements
Markov-modulated finite-source queueing models in evaluation of computer and communication systems (English)
0 references
6 August 2004
0 references
A single-server queueing system serving customers from \(N\) heterogeneous sources is considered. All the sources and the server have rates that depend on independent random environments, governed by ergodic finite-state Markov chains. A source remains inactive as long as one of its requests is in the system. Two asymptotic results are stated (proofs are only sketched): (1) If the arrival rates of all sources go to infinity in a certain way, the length of a busy period is asymptotically exponential. (2) If the service rates go to infinity in a certain way, the first time at which there are \(m\) customers waiting is asymptotically exponential.
0 references
finite-source queueing
0 references
Markov modulation
0 references
asymptotic behavior
0 references