SINGLE SERVICE DIMENSIONING (1)

In the illustration below, three lines (3 Erl) are used to provide traffic for 150 speech users with an offered traffic requirement of 16.1 mErl. The total offered traffic is (150X16.1) = 2.4 Erl.

SINGLE SERVICE DIMENSIONING (2)

The Erlang B formula illustrated below may be used to calculate the Blocking Probability (PB) or Grade of Service (GoS) of the network.
This formula can cause numerical problems on a computer. When the number of lines N is large, terms like N! can exceed computer limits. For example, 171! exceeds the largest double-precision number which is about 1,8*10308 . Applications like call centers often require values of N > 171.

SINGLE SERVICE DIMENSIONING (3)

In this example the Blocking Probability is calculated below.

0.2684

26.84

The calculations are based on =2.4 erl. However, the accurate value of = 2.415 erl, which gives Blocking equal to 0.27049 or 27.049%.

A recurrent formula for Erlang B (1)

The following recurrent formula is convenient for computation:

aEs1 (a) Es (a) = , E0 (a) = 1 s + aEs1 (a)

Proof (1)

A formula used in xls calculations!

E S ( ) = s! i = S i! i=0 1
S 1

S 1 s(s 1)!
S 1 i=0

+ i! s!

S 1 s(s 1)!
S 1 i=0

+ i! s(s 1)!

S 1

i=0

i i! 1 i i!

S 1 s(s 1)! S 1 s(s 1)!

1+

S 1 i=0

A recurrent formula for Erlang B (2)

Proof (2)
Since:

E S 1 ( ) =

S 1 (s 1)!
S 1 i=0

i i!

the recurrent equation results.

aEs1(a) Es (a) = , E0 (a) =1 s + aEs1(a)

Blocking Probability vs Number of Servers

The following graph shows the call blocking probability for various traffic loads (1 to 20 erl) and different number of servers. According to the results we see a decrease in call blocking when we add servers (this is expected) which becomes substantial in the case of 15 servers.
1.0 0.8

Call Blocking Probability

5 servers
0.6

10 servers
0.4

15 servers

0.2

0.0 0 2 4 6 8 10 12 14 16 18 20

Offered Traffic Load (erl)

Traffic load curves

In practice it is often necessary to determine the number of trunks required for carrying a given traffic load at a given GOS. Curves indicating the relation between and the number of trunks s providing a given GOS, are called traffic load curves (see fig).
50 B=0.01 B=0.01 n: n=50
0 10 n=

n: number of users
n=40

(erl)

40

Offered traffic (erl)

30 n=30 20 n=20 10 n=10

Erlang B

n=

0 0 10 20 30 40 50

Number servers of Servers

Performance Measures of Erlangs loss model

N = jP( j ) =
j =0 j =0

s aj a j 1 j P(0) = a P(0) = a(1 Es (a)) j! j =1 ( j 1)!

N = a(1 Es (a)) = acarried

Average number of calls in the system Average number of busy servers

Server Utilization =

a (1 E s ( a )) s

where Es() is the Erlang B formula

Increase in carried traffic when the number of servers is increased from s to s+1:

a ( E s ( a ) E s +1 ( a ))

MULTI-SERVICE DIMENSIONING (1)

A network with five channels (5 E) serving 50 users with two data services C1 and C2 requiring 1 and 2 channels respectively is illustrated below.

Since C1 requires 1 channel and C2 requires two, there could never be more than five C1 connected or more than two C2 connected users. The blocking probability for each service can be calculated by adding the probabilities of each blocking combination.

MULTI-SERVICE DIMENSIONING (2)

Bandwidth sharing policy: Complete Sharing policy
Link of C= 5 1st service: b1=1 2nd service: b2=2 1st service calls C=5

lost traffic

available bandwidth unit

offered traffic
2nd service calls

carried traffic

time

MULTI-SERVICE DIMENSIONING (3)

State space Product form solution Local Balance
C = 5, b1 = 1, b2 = 2
n2
n2

12 states

(n1, n2)

n2 2

2
1
( n1 + 1) 1

Local balance

2 1

n1

1
n1 1

n1+

(n2 + 1)2

n1 0 1 2 3
1

+ n2

5
n ak k nk !

Product form
solution

P (n ) = G

k =1

where n = (n1, n2,nk,,nK), k=k/ (erl) and

n K ak k G G() = n ! n k =1 k

MULTI-SERVICE DIMENSIONING (4)

State space Blocking states for our example
In-service In-service Occupied bandwidth in calls calls the system, Blocking for Blocking for of 1st class of 2nd class j=n1*b1+n2*b2=n1+2n2 1st class 2nd class n1 n2 j=n1*b1+n2*b2
0 0 0 1 1 1 2 2 3 3 4 5 0 1 2 0 1 2 0 1 0 1 0 0 0 2 4 1 3 5 2 4 3 5 4 5

KAUFMAN-ROBERTS ALGORITHM (1)

C = 5, b1 = 1, b2 = 2 2
1 1
j=2

2
1

2
1 j=3 1y1(3) 1y1(4)

2
1 j=4 1y1(5)

2
j=5

j=0

j=1

1y1(1)

1y1(2)

(Note that the formulas use integer values for bandwidth)

2y2(2)

2y2(3)

2y2(4)
k

2y2(5)
Formula Kaufman / Roberts (1981)
j

j-b k

(IEEE Trans. on Commun.)

local balance

k q( j bk ) = yk ( j )k q( j )
Kaufman (1981)

y k (j) k

Call blocking probability: P k = G q( j ) b j =C bk +1 Accurate and easy calculation!

G=

j =0

q( j )

KAUFMAN-ROBERTS ALGORITHM (2)

Unnormalized values of q(j)s for our example: q(0)=1, q(1)=1, q(2) = 0.75, q(3)= 0.4166, q(4) = 0.1979, q(5)=0.08125 G = 3.4458 (normalization constant) Normalized values of q(j)s for our example: The previous values are divided by G q(0)=0.2902, q(1)=0.2902, q(2) = 0.21765, q(3)= 0.12092, q(4) = 0.057436, q(5)=0.023579

Blocking probabilities: Pb1 = q(5) = 0.023579 Pb2 = q(4)+q(5)=0.08102

The values in Figure 4-16 (page 106) and Fig 4-17 (page 107) are wrong!

KAUFMAN-ROBERTS ALGORITHM (3)

Why not to use ErlangB instead of Kaufman-Roberts?

Simple Example: Consider two services with b1=1 b.u and b2=16 b.u. Let 1=25 erl and 2=1.5625 erl (values chosen so that 1b1 = 2b2).

System should be dimensioned so that GOS = 0.001. Find the capacity C.

1st approach: Use the Kaufman-Roberts formula Results: C = 146 b.u. and Pb1 = 0.00002 and Pb2 =0.00099 (smaller than GOS=0.001) 2nd approach: Use the Erlang B formula for each service-class Results for the 1st service (1=25 erl and b1 = 1 b.u.): C = 41 b.u. (Pb1=0.00002) Results for the 2nd service (2=1.5625 erl and b2 = 1 b.u.): C = 7 b.u. (Pb2 = 0.00053) This value should be multiplied by b2=16 b.u. and therefore C = 7*16= 112 b.u. So Ctotal = 41 + 112 = 153 b.u. > 146 b.u. given by Kaufman-Roberts formula

KAUFMAN-ROBERTS ALGORITHM (4)

3rd approach: Use the Erlang B formula assuming that total = 1b1 + 2b2 = 50 erl This gives C = 71 b.u. (much lower compared to 146 b.u. given by Kaufman-Roberts formula).

The Bandwidth Reservation Policy

Random arriving calls

QoS guarantee

ON constant bit rate

Link of Capacity C = 8 1st Service-class: b1=1 2nd Service-class: b2=2

While in service:

Traffic Loss

Free Bandwidth Unit Reserved Bandwidth Unit (to benefit the 2nd service-class)

fixed bandwidth requirement upon arrival

1st Service-class calls

C=8

Offered traffic

Carried traffic

fixed bandwidth requirement upon arrival

2nd Service-class calls

time

Exponentially Distributed Interarrival Time

Bandwidth Reservation Policy