| Meaning: |
Modeling of sources with multiple states (usually 2 - 5) in ATM networks |
| Description: |
State machine with \(m\) states.
-
Markovian process with the rate \(\lambda_i\) in the state \(i\)
-
number of arrivals \(X_i\) in state \(i\) is arbitrarily (discretely)
distributed (often shifted geometrically -> MMPP); in the silence state
\(X_i\) means the number of time slots of the silence phase.
-
according to definition: \(p_{ii} = 0\) and \(\sum\limits_{i=1}^m p_{ij} =
1\).
|
| Parameters: |
-
number of states \(m\)
-
transition probabilities \(p_{ij}\)
-
distribution of the number of arrivals \(X_i\) in the individual states
-
arrival rates \(\lambda_i\) in the states
|
| Characteristic values: |
Moments and distribution of the arrival intervals |
| Parser example: |
[...].distribution = GMPP
[...].distribution.States = 2
[...].distribution.MeanIATs = [1 5]
[...].distribution.StateDuration_0 = Constant
[...].distribution.StateDuration_0.Mean = 10000
[...].distribution.StateDuration_1 = Constant
[...].distribution.StateDuration_1.Mean = 10000
[...].distribution.TransitionProbs = [[0 1] [1 0]]
|
| References: |
-
P. J. KÜHN: Reminder on queueing theory for ATM networks. Telecommunication
Systems, No. 5, 1996, pp. 1-24.
-
G. D. STAMOULIS, M. E. ANAGNOSTOU, A. D. GEORGANTAS: Traffic source models
for ATM networks: a survey. Computer Communications, Vol. 17, No. 6, Juni,
1994.
-
T. THEIMER: How to compute the moments of a GMDP, RACE 1022, Document
UST_123_0023_CD_CC, 1989.
|