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.
As already indicated, continuous space is<br />
not very interesting in teletraffic, but it is<br />
sometimes used in mathematical analysis,<br />
when traffic is considered as a diffusion<br />
process, often with rediscretisation<br />
as a final step. Also in intermediate analysis<br />
stages, calculation of fictitious continuous<br />
server groups may be used to<br />
obtain improved accuracy. Time is most<br />
often considered to be continuous, as the<br />
processes studied are often defined by<br />
random events. However, in modern digital<br />
systems synchronous operation may<br />
be better described in discrete time. If<br />
nothing particular is indicated, discrete<br />
space and continuous time is assumed.<br />
This means that at any instant an integer<br />
number of servers are occupied, and that<br />
the number may change at any instant in<br />
continuous time. In a so-called orderly<br />
process (to be discussed later), any<br />
change is by ±1 only.<br />
6 Traffic variations<br />
6.1 Telephone traffic<br />
The traffic load on a traffic carrying system<br />
is subject to more or less regular<br />
variations on different time scales. In<br />
order to understand the causes behind<br />
such variations one has to study the natural<br />
activity patterns of the set of traffic<br />
sources and the resulting behaviour in<br />
relation to the system. This behaviour is<br />
not independent of the system response.<br />
One can imagine a basic traffic potential<br />
under given conditions of a well dimensioned<br />
system and reasonable tariffs. The<br />
system carries that potential, and it can<br />
be said that the system feedback is weak.<br />
If for some reason a narrow bottleneck<br />
occurs, many call attempts fail. The<br />
result is double: 1) some failed attempts<br />
are repeated, thus increasing the call rate<br />
and giving a further rise in the lost call<br />
rate, and 2) some failed attempts lead to<br />
abandonment, thus leading to less carried<br />
useful traffic. (These effects will be discussed<br />
later under repeated calls.) In general<br />
an improved system, as sensed by<br />
the users, and cheaper tariffs are also<br />
feedback that tend to increase the traffic.<br />
In this section we will assume well<br />
dimensioned system and stable tariffs.<br />
We assume a set (N) of traffic sources<br />
that operate independently. This is a realistic<br />
assumption under normal circumstances.<br />
The service system consists of a<br />
set of servers (n), where n is large enough<br />
to carry the traffic demand at any time. A<br />
time function of the number of busy<br />
servers depicts the stochastic variation of<br />
the carried traffic. It is a discontinuous<br />
curve with steps of ±1 occurring at irregular<br />
intervals, as shown in Figure 3.<br />
An observation period T is indicated, and<br />
it is possible to define an average traffic<br />
Am (T). At this point it is convenient to<br />
define a traffic volume, being the integral<br />
under the traffic curve<br />
� T<br />
V (T )= r(t)dt<br />
(1)<br />
r(t)<br />
t 0<br />
o<br />
where r(t) is the number of busy servers<br />
(the instantaneous traffic value) at time t.<br />
The mean traffic value is given by<br />
V (T )<br />
Am(T )= (2)<br />
T<br />
A 24-hour integration gives the total traffic<br />
volume of that period, and hence<br />
A mom -Poisson traffic σ 2 =m<br />
A mid<br />
Observation period T<br />
Figure 3 Stochastic traffic variations over an observation period T<br />
Busy hour<br />
t 0 +T<br />
n 1 +n 2<br />
Overflow<br />
traffic<br />
σ 2 >m<br />
n 1<br />
Smoothed<br />
traffic<br />
σ 2