Contents Telektronikk - Telenor
Contents Telektronikk - Telenor
Contents Telektronikk - Telenor
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
186<br />
Level duration<br />
The state sojourn time corresponds to the<br />
time the source stays within one level.<br />
See Figure 3.4.a for an example of one<br />
observation of a sojourn time, TB . Hence,<br />
from the sample output of the source, the<br />
distribution of the state sojourn times<br />
may be estimated, i.e.<br />
P {TB ≤ t} = #(TB ≤ t)<br />
#(TB)<br />
If the sojourn time distribution is sufficiently<br />
close to a negative exponential<br />
distribution, i.e.<br />
t − E(T P {TB ≤ t} ≈1 − e B )<br />
the level may be modelled by a single<br />
phase state. What is accepted as “sufficiently<br />
close”, depends on modelling<br />
accuracy and the constraints put by the<br />
STG hardware, for instance the number<br />
states available in a scenario discussed in<br />
Section 4.2.2. If the sojourn time distribution<br />
differs significantly from a negative<br />
exponential distribution, we may<br />
split the state into a number of phases<br />
similar to the examples in Section 3.1.1<br />
above.<br />
Following this procedure, a Markov<br />
model representing the burst level of the<br />
source without distinct states is established.<br />
It should also be checked for dependencies<br />
between the sojourn times on the<br />
various levels and the next level/state. If,<br />
for instance, there is a positive correlation<br />
between long sojourn times in state<br />
C and transitions into state D (and between<br />
shorter sojourn times and transitions<br />
into B and A), we may include this<br />
A B<br />
C<br />
D<br />
into the phase type model. See Figure 3.5<br />
for an example. In this case, transitions to<br />
A and B will take place after the sojourn<br />
time of the first phase (negative exponentially<br />
distributed) and transition into D<br />
after the sojourn times of both phases<br />
(generalised Erlang-two distributed).<br />
Other combinations of sojourn times –<br />
transition dependencies may of course<br />
also be constructed.<br />
Validation<br />
A check of whether reasonable sojourn<br />
times and transition probabilities are<br />
obtained or not, may be obtained by<br />
- computing the steady state probabilities<br />
- dividing them by the width of the<br />
respective levels, cf. Figure 3.4.b, and<br />
- comparing the result to the level frequency<br />
plots.<br />
In the above procedure, it is implicitly<br />
assumed that the level/state changing<br />
procedure of the source type has a<br />
(semi-) Markov property. This may be<br />
validated by a direct testing of the properties<br />
of the embedded discrete time<br />
chain [30].<br />
The long term dependencies may also be<br />
validated by a comparison between the<br />
autocorrelation of samples from a source<br />
of this type, and the autocorrelation of<br />
the source type model. (Note that the cell<br />
level should be smoothed.) See [22] for a<br />
computational procedure.<br />
3.2 Cell level modelling<br />
The most important factors determining<br />
the cell level behaviour of a source are:<br />
- the processing, data retrieval and transfer<br />
speed of the end user equipment<br />
- the lower layer protocols, their mechanisms<br />
and implementation<br />
- contention in user equipment and customer<br />
premises network, e.g. a CSMA/<br />
CD based LAN, and<br />
L p - length of cell pattern<br />
IB - miniburst<br />
interdistance<br />
- possible traffic forming mechanisms,<br />
see [31] for a discussion.<br />
Based on the experiences from the cell<br />
level modelling so far, a framework for<br />
building cell patterns will be outlined in<br />
this section. Focus will be on the major<br />
influences from the various protocols in<br />
the protocol hierarchy as well as the<br />
other facts mentioned above. For some<br />
source types, not utilising all protocol<br />
levels only parts of the discussion apply.<br />
An example is variable bitrate video<br />
transfer presented directly to the AAL.<br />
However, the basic approach should<br />
apply. The parameters may be obtained<br />
by deduction from system and protocol<br />
descriptions, from measurements of systems<br />
and protocols if these are available,<br />
or by a combination of these approaches.<br />
A cell pattern consists of a set of<br />
minibursts, or subpatterns. These are<br />
usually, but not necessarily, regular.<br />
Minibursts arise from higher level protocol<br />
data units which propagate down<br />
through the protocol levels and result in a<br />
short burst of cells. Figure 3.6 shows a<br />
generic regular cell pattern with its<br />
descriptive parameters, a 4-tuple {IC , IB ,<br />
LB , LP }. In the following we focus on the<br />
different parameters in the tuple, except<br />
for the length of the pattern, LP , which is<br />
chosen to fit the regularity described by<br />
the other parameters as well as the design<br />
of the STG, cf, Section 4.2.3.<br />
3.2.1 Peak cell rate<br />
The peak cell rate is the inverse of the<br />
minimum inter-cell distance, i.e.<br />
1/Min(IC ). The inter-cell distance or cell<br />
spacing depends primarily on the implementation<br />
of AAL (ATM Adaption<br />
Layer). Two extremes may be identified:<br />
- Maximum stretching, as described in<br />
[31]. This implies that cells are spaced<br />
as evenly as possible. The allowable<br />
spacing will depend on the real time<br />
requirement of the source/user. Usually,<br />
these are so slack that cells may be<br />
evenly spaced over an entire pattern,<br />
L B - length of miniburst<br />
V B - volume of miniburst<br />
Figure 3.5 State C is split into two<br />
phases to include sojourn time transition<br />
IC - cell interdistance<br />
dependencies Figure 3.6 Parameterized framework for building cell level models based on patterns