
39-12
attempts to establish a connection through the system
during a specific period of time, usually the busy hour.
The traffic capacity of a switch, switching network, or
trunk group is the traffic load that will, on the average,
provide the grade of service that is chosen as the service
objective.
For measurement purposes, it is sometimes easier to
observe the proportion of time that all circuits are busy
than to count the total of offered and carried calls (or
carried and lost calls). For the usual assumptions of
random calling, infinite sources, and a level value of
offered traffic, the proportion of calls blocked and the
proportion of time all circuits are busy are equal. This
relation does not persist for assumptions of peaked
traffic, smooth traffic, or limited sources.
Choice
of
Formula
The most important factors determining the choice of
formula for estimating grade of service are as follows:
A. The statistical nature of the call originations
Random from infinite sources
Random from finite sources
Peaked from infinite sources
Smooth from infinite sources
Periodic
B.
C.
The probability distribution of the call holding
time
The availability of the circuits serving the traffic
Full access
Limited access in a graded multiple
Limited access through a switching network
Lost calls cleared
Lost calls delayed
Lost calls held
Lost calls retried at a later time
D.
The behavior of calls when blocked
Traffic Equations
The two most commonly used equations in trunk
service estimation
are
the Erlang
B
and the Poisson. In
general, the Erlang
B
is a good estimator of single-hour
service, while the Poisson is a good estimator of the
service given
on
the average over a busy season during
which the offered load varies over a wider range than
would be expected from the assumptions of random
offered traffic.
In general, the use. of the Poisson
equation is not recommended for grades of service that
exceed
0.10
(10% blocking).
In small networks, it may be necessary to take limited
sources into account. This results in the Engset and
binomial equations as indicated below.
The Erlang B equation is given by
x=c
B(c,a)
=
(aC/c!)/
d/x!
x=o
The corresponding Engset equation for limited sources
is solved only by iterative techniques. Tables are avail-
able for this purpose.
*
The Poisson equation
is
given by
m
P(C,U)
=
e-a
2
(ax/x!)
x=c
The corresponding binomial equation is given by
Finally, the Erlang C equation is given by
C(c,a)
=
(a"c!)[c/(c
-
a)]/
c-
1
x=o
{
2
aX/x!
+
(a"c!)[c/(c
-
a)]}
where,
a
=
offered load in erlangs,
c
=
number of circuits,
n
=
number of limited sources less one,
r
=
load offered by an idle source.
Although the above equations are derived on the
assumption of a negative exponential distribution of
holding times, they are reasonable approximations for
most distributions encountered in practice.
The Erlang
B
equation is particularly useful in
estimating the load that will be carried on and overflow-
ing from a direct group of trunks to which random
traffic is offered. Calls that find all direct circuits busy
are directed to an alternate route. The traffic carried on
the direct route will be
a[l
-
B(c,a)],
and the traffic
overflowing will be
&(c,a),
where
a
=
the random
offered traffic. The overflow traffic is no longer random,
and other approximations are necessary to estimate the
grade of service given by an alternate trunk group to
overflow traffic. For this purpose, it is necessary to
estimate the variance of the overflow traffic, or more
conveniently, the ratio of the variance to the mean. This
latter quantity is known as the
peakedness
of the traffic.
(Random traffic from an infinite source has a peaked-
ness of one.) Peakedness,
z,
of traffic overflowing from
c
trunks offered
a
erlangs under the LCC assumptions is
given by:
z
=
1
-
aB(c,a)
+
a/[c
+
1
+
aB(c,a)
-
a]
When a number of overflow loads from a number of
direct groups are combined, the peakedness of the total
is given closely by
z
=
i:
zxa',li:
a',
x=
1
*=I
where
a',
is the overflow load from the xth source.
-
*Telephone Traflc Theory, Tables and Charts.
Berlin-
Munich: Siemens Aktiengesellschaft,
1970.