Contents Telektronikk - Telenor
Contents Telektronikk - Telenor
Contents Telektronikk - Telenor
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Aspects of dimensioning transmission resources in B-ISDN<br />
networks<br />
BY INGE SVINNSET<br />
1 Introduction<br />
The complexity of current telecommunication<br />
networks makes it very important<br />
to have good network planning routines<br />
to meet the demands of the customers<br />
with the necessary investments. One<br />
important part of this is the dimensioning<br />
of the needed transmission resources, and<br />
a subtask is the dimensioning of the number<br />
of channels needed between each pair<br />
of network switching nodes. This is what<br />
we understand by dimensioning of trunk<br />
groups. Input to this task is the forecast<br />
traffic demands and the mapping of these<br />
demands onto the network routes where<br />
the various calls can be placed. This is<br />
then again mapped onto the trunk groups<br />
taking part in the route.<br />
In telephony a channel is a dedicated<br />
physical resource that must be reserved<br />
for a single call for the whole lifetime of<br />
the call. In today’s digital networks these<br />
physical resources are divided in timeslots<br />
(Time Division Multiplexing,<br />
TDM). Every Nth slot is reserved for a<br />
single call, i.e. every Nth slot belongs to<br />
one channel where N depends on the rate<br />
of the physical medium, e.g. 2 Mb/s or<br />
34 Mb/s.<br />
In ATM a channel has a more complex<br />
definition and the amount of resources<br />
needed for one channel is not static but<br />
depends on the needed data rate and the<br />
needed quality of service. The data rate<br />
of a channel may also vary in time. This<br />
complexity gives an increased flexibility<br />
and a possibility for saving capacity (statistical<br />
multiplexing gain) and these are<br />
also two of the reasons for the attractiveness<br />
of ATM. But it also creates new<br />
problems and new challenges for the network<br />
planning task.<br />
In this paper we will present some methods<br />
for dimensioning of the required<br />
capacity of trunk groups in an ATM network.<br />
The task is to provide enough<br />
capacity for the forecast traffic needs and<br />
at the same time satisfy the given quality<br />
of service constraints. A subtask of this is<br />
to look for ways of dividing capacity between<br />
different traffic types to obtain a<br />
more effective utilisation of the network<br />
resources. The intention of such a division<br />
is to give a lower dimensioned<br />
capacity than we would have obtained<br />
without using such methods. This division<br />
will have implications for the connection<br />
admission procedure.<br />
An ATM link (= transmission path in<br />
[5]) is in this context a physical transmission<br />
channel, characterised by a constant<br />
bit rate (for example 150 Mb/s or 600<br />
Mb/s) and extending between a pair of<br />
transmission path connection end-points.<br />
A virtual channel connection (VCC) is an<br />
end-to-end virtual connection, set up between<br />
two users and characterised by<br />
traffic parameters (for example peak bit<br />
rate and mean bit rate). A virtual path<br />
connection (VPC) is set up between two<br />
ATM switching nodes, between a user<br />
and a switching node or between two<br />
users. It can be characterised in the same<br />
manner as a VCC. An ATM link can<br />
contain one or many VPCs and a VPC<br />
can contain one or many VCCs. For<br />
more exact definitions and more information<br />
about these concepts we refer to [5].<br />
This paper considers only VPCs or<br />
VCCs, i.e. we do not treat the problems<br />
related to bundling VCCs into VPCs.<br />
Except for the first part of this paper<br />
where we treat the multi-dimensional<br />
Erlang loss formula, we only treat linear<br />
Connection Admission Control (CAC)<br />
functions. The connection admission is<br />
then based on the calculation of an equivalent<br />
bandwidth for each connection.<br />
Ignoring the Cell Delay Variation (CDV)<br />
tolerance this equivalent bandwidth may<br />
equal the peak bit rate or may be less<br />
than the peak bit rate but higher than the<br />
mean bit rate. Taking CDV tolerance into<br />
account the equivalent bandwidth may<br />
become higher than the declared peak bit<br />
rate if the CDV tolerance is allowed to<br />
take a high value.<br />
2 Performance parameters<br />
that impact<br />
dimensioning<br />
Performance parameters are divided into<br />
direct and derived performance parameters.<br />
Derived parameters such as<br />
availability will not be considered here.<br />
Direct performance parameters can be<br />
divided into<br />
- call/connection processing performance<br />
parameters<br />
- information transfer performance<br />
parameters.<br />
The connection processing performance<br />
parameters concern the establishment,<br />
release and parameter change of connections.<br />
These are<br />
- connection rejection probability<br />
- connection set-up delay<br />
- connection release delay<br />
- in-call connection parameter change<br />
delay.<br />
The information transfer performance<br />
parameters to be considered are<br />
- cell error ratio<br />
- cell loss ratio<br />
- cell misinsertion rate<br />
- severely errored cell block ratio<br />
- cell transfer delay<br />
- cell delay variation.<br />
Of these performance parameters the two<br />
parameters that have most impact on<br />
trunk dimensioning are:<br />
- connection rejection (blocking) probability,<br />
and<br />
- maximum cell loss ratio.<br />
The connection blocking probability is<br />
the probability that the network is not<br />
able to deliver a connection between two<br />
users due to lack of network resources or<br />
due to errors in the network. A network<br />
dimensioned for every possible circumstance<br />
will be a very expensive network,<br />
if possible to realise at all. For this reason<br />
we need to set a positive value for this<br />
parameter, a connection blocking objective,<br />
taking both cost and user satisfaction<br />
into account.<br />
The connection blocking objective may<br />
differ between the services. If no service<br />
protection is used the high capacity services<br />
will certainly experience a higher<br />
probability of connection blocking than<br />
the low capacity services. This can be<br />
very unsatisfactory. Although it is not<br />
necessary to offer the same maximum<br />
connection blocking probability for all<br />
services, it is necessary to use some kind<br />
of service protection method to control<br />
the quality of service. Service protection<br />
methods should be used to dimension the<br />
network with specified connection blocking<br />
objectives for the different services.<br />
Dimensioning should be made for busy<br />
hour in the same manner as for traditional<br />
circuit switched networks, but the busy<br />
hour may be different for the different<br />
services.<br />
When it comes to the information transfer<br />
performance, different services will<br />
have different requirements with regard<br />
to cell delay, cell delay variation and cell<br />
loss ratio. For the exact definitions of the<br />
information transfer performance parameters,<br />
see [6]. Some services like telephony<br />
are not so sensitive to cell losses,<br />
but cell delay and delay variation must be<br />
small. For data services the requirement<br />
139