Pemodelan Sistem Jaringan dan

Trafik

Kongesti Trafik
Kongesti adalah suatu keadaan dimana semua server
sedang dalam keadaan diduduki serempak pada satu
waktu
Penanganan terhadap panggilan-panggilan yang
datang pada saat kongesti bergantung kepada sistem
operasi server yang ada

Kongesti Trafik
1. Loss system (lost call cleared)
Pada sistem ini, panggilan yang datang saat seluruh sirkit sibuk, akan
ditolak akan dibuang dari sistem.
Bila ada panggilan ulang (repeated call), dianggap panggilan yang
baru.
Sistem ini biasanya digunakan untuk menentukan jumlah saluran
antar sentral
A

Y
SN

Kongesti Trafik
2. Delay System (lost call delayed)
Panggilan yang datang saat seluruh sirkit sibuk,maka panggilanpanggilan tersebut akan menunggu di buffer yang disediakan sampai
ada sirkit yang bebas.
Sistem ini digunakan untuk komunikasi data yang tidak memerlukan
komunikasi real time

Kongesti Trafik
3. Overflow system (lost call held)
Panggilan-panggilan yang tidak bisa dilayani kerena seluruh group
sirkit ke suatu arah dalam kondisi diduduki, maka diluapkan ke group
sirkit arah lain (alternative route)
System ini digunakan untuk mendisain suatu MEA (multi exchange
Area)
Tandem
T
2

Rute alternatif
P
Asal
5

1
Rute langsung
(high-usage route)

Q
Tujuan

Grade of Service (GOS)

Dalam loss system (sistem rugi), trafik yang dibawa
atau dilayani oleh jaringan lebih kecil dari trafik yang
ditawarkan sesungguhnya ke jaringan.
Kelebihan trafik yang tidak mampu dilayani oleh
jaringan akan ditolak atau dibuang.
Jumlah trafik yang ditolak oleh jaringan digunakan
sebagai indek dari kualitas pelayanan dari jaringan
yang disebut dengan grade of service (GOS) atau B

Grade of Service (GOS)

Grade of Service didefinisikan sebagi perbandingan trafik yang
hilang (ditolak) dengan trafik yang ditawarkan ke jaringan.
A
B=
B=

Dimana :
B adalah
A adalah
Y adalah
R adalah
7

R
A
AY
A

SN
R

Grade of service(GOS)
offered traffic atau trafik yang ditawarkan ke saluran
carried traffic atau trafik yang dibawa/dilayani oleh saluran
trafik yang gagal (loss traffic)

 Probabilitas Blocking didefinisikan sebagai probabilitas seluruh saluran

(server) dalam sistem sedang sibuk.
Jika seluruh saluran sibuk, tidak ada trafik yang bisa dilayani oleh sistem
dan panggilan yang datang akan ditolak.
Dalam sistem loss probabilitas blocking sama dengan GOS, dikarenakan
lamanya holding time call yang hilang dianggap sama dengan holding time
call yang terlayani
Perbedaan mendasar antara GOS dan probabilitas blocking adalah :
GOS diukur dari titik pelanggan,diamati panggilan yang ditolak. Sedangkan probabilitas
blocking diukur dari titik network atau switching, dimana diamati server-server (saluran)
yang sibuk dalam system switching.
GOS disebut juga dengan Call congestion atau loss probability dan probabilitas blocking
disebut dengan time congestion.

Call Rates
In a loss system each call is either loss or carried
Thus, there are three types of call rates:
Offered traffic
Carried traffic
Loss traffic

Call Rates
Offered traffic (A)

SN

carried traffic (Y)

loss traffic (R)

10

Carried traffic (Y)

11

12

13

14

Grade of Service (GOS)

Grade of Service is comparison between lost
traffic and offered traffic in network.
GOS =

R
B=
A

or

AY
B=
A

Smaller GOS is better services.

15

Exercise

16

Probability of Blocking
Definition of Probabilitas Blocking is
probability all line (server) in system is busy.
If all line is busy ( use ), no traffif can serve by
system and arrival call will be blocking.

17

GOS vs probability blocking

GOS ( grade of services ) calculate from user side,
estimate by call block.
probabilitas blocking calculate from network
switching side, estimate by server or line busy ini
system switching.
GOS is Call congestion or loss probability and
probability blocking is time congestion.

18

More examples
A group of 20 subscribers generate 50 calls with an
average holding time of 3 minutes, what is the
average traffic per subscriber?
Traffic = (50 calls)*(3min)*(1 hour/60 min)
= 2.5 Erlangs
= 2.5 / 20 or 0.125 Erlangs per subscriber.
Individual (residential) calling rates are quite low and
may be expressed in milli-Erlangs, i.e. 0.125 Erlangs
= 125 milli-Erlangs.

19

20

21

22

23

24

25

26

27

Traffic Model Choice

Traffic model choice is use to calculate capacity
needed, and get GOS what we want.

28

Pemilihan Model Trafik

In Traffic model choice, we have to considere this
parameters :

Arrival rate pattern

Traffic blocking
The number of traffic source
holding time

29

Traffic Arrival Pattern and

Arrival Probability Distribution

Main Traffic Arrival Pattern are :

smooth call arrival pattern
peak call arrival pattern
random call arrival pattern

30

smooth call arrival pattern

Smooth or hypo-exponential traffic happen when traffic

variation is not to big. holding time and interarrival time can
be prediction.

31

Peaked Call Arrival Pattern

32

Random Call Arrival Pattern

33

Blocked Calls
Block call will be effect on model choice because
different block call is different traffic load.
F=first attemp

Trunk

O=offered

C=carried traffic

Call held

Calls cleared

Call
delayed

34

Blocked Calls
There type of block call are :
Lost Calls Held (LCH)
Lost Calls Cleared (LCC)
Lost Calls Delayed (LCD)
Lost Calls Retried (LCR)

35

Types of Blocking Models

Blocked Calls Cleared (BCC
BCC)
Blocked calls leave system and do not return
Good approximation for calls in 1st choice trunk group

36

Types of Blocking Models

BCH)
Blocked Calls Held (BCH
Blocked calls remain in the system for the amount
of time it would have normally stayed for
If a server frees up, the call picks up in the middle
and continues
Not a good model of real world behaviour
(mathematical approximation only)
Tries to approximate call reattempt efforts

37

Types of Blocking Models

BCW)
Blocked Calls Wait (BCW
Blocked calls enter a queue until a server is
available
When a server becomes available, the calls
holding time begins

38

Blocked Calls Cleared (BCC)

2 sources
10 minutes
Source #1
Offered Traffic

Source #2
Offered Traffic

1st call arrives and is served

Only one server

2nd call arrives but

server already busy

Traffic
Carried

Total Traffic Offered:

TO = 0.4 E + 0.3 E
TO = 0.7 E

Total Traffic Carried:

TC = 0.5 E

2nd call is cleared

3rd call arrives and is served
4th call arrives and is served
39

Blocked Calls Held (BCH)

2 sources
10 minutes
Source #1
Offered Traffic

Source #2
Offered Traffic

Total Traffic Offered:

TO = 0.4 E + 0.3 E
TO = 0.7 E

1st call arrives and is served

Only one server

2nd call arrives but server busy
Traffic
Carried

2nd call is held until server free

1

2 2

4
2nd call is served

Total Traffic Carried:

TC = 0.6 E

3rd call arrives and is served

4th call arrives and is served
40

Blocked Calls Wait (BCW)

2 sources
10 minutes
Source #1
Offered Traffic

Source #2
Offered Traffic

Total Traffic Offered:

TO = 0.4 E + 0.3 E
TO = 0.7 E
1st call arrives and is served
2nd call arrives but server busy

Only one server

2nd call waits until server free

Traffic
Carried

Total Traffic Carried:

TC = 0.7 E

2nd call served

3rd call arrives, waits, and
is served
4th call arrives, waits, and
is served
41

Lost model

42

Traffic Model

Erlang B,
Extended Erlang B, and
Erlang C. Other commonly adopted traffic models are
Engset,
Poisson,
EART/EARC, and
Neal-Wilkerson.

43

Comparison of Model Traffic

Source

Arrival
Pattern

Blocking call

Holding
Times

Poisson

Infinite

Random

Held

Exponential

Erlang B

Infinite

Random

Cleared

Exponential

Extended Erlang B

Infinite

Random

Retried

Exponential

Erlang C

Infinite

Random

Delayed

Exponential

Engset

Finite

Smooth

Cleared

Exponential

EART/EARC

Infinite

Peaked

Cleared

Exponential

Neal-Wilkerson

Infinite

Peaked

Held

Exponential

Crommelin

Infinite

Random

Delayed

Constant

Binomial

Finite

Random

Held

Exponential

Delay

Finite

Random

Delayed

Exponential

Model Traffic

44

Comparison Traffic Model

45

Application of Erlang B Traffic Model

Designing public phone systems where:
blockage is very low and hence retries are
uncommon (and can be neglected), or
blockage may be high, but blocked calls overflow
to some other facility (modeled separately)
Grade of Service, non-USA Telcos
Grade of service in commercial (low blockage)
networks
46

Application of PoissonTraffic Model

Grade of Service, USA Telcos
Grade of service in commercial networks
PBX trunk sizing in large offices

47

Application of Erlang C Traffic Model

Calculating staffing levels (i.e.. required
agents) for customer call centers
Auto-Attendants, Auto Call Distributors (ACDs)
Latency in data transmission circuits
Bank Teller, Supermarket, etc. lines

48

Application of EngsetTraffic Model

Designing private phone systems (PBXs)
where:
blockage is very low and hence retries are
uncommon (and can be neglected), or
blockage may be high, but blocked calls overflow
to some other facility (e.g. public phone system)

49

Application of BinomialTraffic Model

Designing private phone systems (PBXs)
where:
Office size (sources) is small
Where there is no overflow
Networked servers (e.g. Fax Servers, Modem
Pools,)
Help Desk phone traffic.

50