| Meaning: |
Modeling from sources with multiple states |
| Description: |
-
State machine with \(m\) states.
-
Discrete Markovian process with the transition probability \(p_{ij}\) from
state \(i\) to state \(j\) after each time slot \(\Delta t\), which is a
combination of two components: \(p_{ij} = c_{ij} + d_{ij}\)
-
Transition probability from state \(i\) to state \(j\) without an arrival
event upon transition: \(c_{ij}\)
-
Transition probability from state \(i\) to state \(j\) with an arrival event
upon transition: \(d_{ij}\)
-
According to definition: \(\sum\limits_i p_{ij} = 1\)
|
| Parameters: |
-
number of states \(m\)
-
transition probabilities without arrival \(c_{ij}\)
-
transition probabilities with arrival \(d_{ij}\)
|
| Characteristic values: |
see C. BLONDIA, T. THEIMER |
| Parser example: |
[...].distribution = DMAPDistribution
[...].distribution.States = 2
[...].distribution.CMAP = [[0.2 0.5] [0.1 0.3]]
[...].distribution.DMAP = [[0.2 0.1] [0.2 0.4]]
|
| References: |
-
C. BLONDIA, T. THEIMER: A Discrete-Time Model for ATM Traffic, RACE 1022,
Document PRLB_123_0018_CD_CC/UST_123_0022_CD_CC, 1989.
-
P. J. KÜHN: "Reminder on queueing theory for ATM networks." Telecommunication
Systems, No. 5, 1996, pp. 1-24.
|