TUGAS KOM 511

ANALISIS JARINGAN KOMPUTER

MENENTUKAN DESAIN CAPASITATED MINIMUM SPANING TREE

MENGGUNAKAN ALGORITMA ESAU-WILLIAMS

Disusun Oleh :

Iis Rodiah G651180251

Kurniawan Gigih Lutfi Umam G651180011
Nila Susila Yulianti G651180081

PROGRAM STUDI MAGISTER ILMU KOMPUTER

FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM
INSTITUT PERTANIAN BOGOR
2018
 Determine the CMST design of the network with link cost given below
 Node A is the hub/center, all nodes have weight 1 except D which has weight 2
 The link capacity is W =3

B C D E F G
Node
A 5 6 9 10 11 15
B 0 9 6 6 8 17
C 9 0 7 9 8 12
D 6 7 0 10 5 11
E 6 9 10 0 14 9
F 8 8 5 14 0 8

Draw the CMST obtain using packet tracer.

1. Determine CMST using ESAU-Williams Algorithm.

 Compute the tradeoff function for each node.

Tradeoff (Nk) = minjCost(Nk, Nj) – Cost(Comp(Nk), Center)
 Look for the lowest cost (the more negative, the more attractive).
 Check the capacity constraint. Merge is allowed if,
Weight(Comp(Nk)) + Weight(Comp(Nj)) ≤ W

Iteration 1 :
Tradeoff (B) = Cost(B,D) – Cost(A,B) = 6 – 5 =1
Tradeoff (C) = Cost(C,D) – Cost(A,C) = 7 – 6 =1
Tradeoff (D) = Cost(D,F) – Cost(A,D) = 5 – 9 = -4
Tradeoff (E) = Cost(E,B) – Cost(A,E) = 6 – 10 = -4
Tradeoff (F) = Cost(F,D) – Cost(A,F) = 5 – 11 = -6
Tradeoff (G) = Cost(G,F) – Cost(A,G) = 8 – 15 =-7
Tradeoff (G) is the lowest. Since  Wi = WF + WG = 1 + 1 = 2  3, the link (G,F) is
accepted.
 A B

G C

F D

Iteration 2:
Tradeoff (B) = Cost(B,D) – Cost(A,B) = 6 – 5 = 1, unchanged
Tradeoff (C) = Cost(C,D) – Cost(A,C) = 7 – 6 = 1, unchanged
Tradeoff (D) = Cost(D,F) – Cost(A,D) = 5 – 9 = -4, unchanged
Tradeoff (E) = Cost(E,B) – Cost(A,E) = 6 – 10 = -4, unchanged
Tradeoff (F) = Cost(F,D) – Cost(A,F) = 5 – 11 = -6, unchanged
Tradeoff (G) = Cost(G,E) – Cost(A,F) = 9 – 11 = -2

Tradeoff (F) is the lowest. Since  Wi = WF + WG + WD = 1 + 1 + 2 = 4  3, the link

(F,D) is rejected.
Recompute Tradeoff (F) = Cost(F,B) – Cost(A,F) = 8 – 11 = -3, the cost is not the lowest
yet.
Next, consider Tradeoff (D). Similarly with link (F,D), the link (D, F) is rejected.
Recompute Tradeoff (D) = Cost(D,B) – Cost(A,D) = 6 – 9 = -3, the cost is not the lowest
yet.
Consider Tradeoff (E). Since  Wi = WE + WB = 1 + 1 = 2  3, the link (E,B) is accepted.

A B

G C

F D

E
 Iteration
3:
Tradeoff (B) = Cost(B,D) – Cost(A,B) = 6 – 5 = 1, unchanged
Tradeoff (C) = Cost(C,D) – Cost(A,C) = 7 – 6 = 1, unchanged
Tradeoff (D) = Cost(D,B) – 9 = 6 – 9 = -3
Tradeoff (E) = Cost(E,C) – 5 = 9 – 5 = 4
Tradeoff (F) = Cost(F,B) – 11 = 8 – 11 = -3
Tradeoff (G) = Cost(G,E) – 11 = 9 – 11 = -2, unchanged
Tradeoff (D) is the lowest. Since  Wi = WB + WE + WD = 1 + 1 + 2 = 4  3, the link (D,B)
is rejected.
Recompute Tradeoff (D) = Cost(D,C) – 9 = 7 – 9 = -2, the cost is not the lowest yet.
Consider Tradeoff (F). Since  Wi = WB + WE + WF + WG = 1 + 1 + 1 + 1 = 4  3, the link
(F,B) is rejected.
Recompute Tradeoff (F) = Cost(F,C) – 11 = 8 – 11 = -3
Since  Wi = WF + WG + WC = 1 + 1 + 1 = 3  3, the link (F,C) is accepted.

A B

G C

F D

Iteration 4:
Tradeoff (B) = Cost(B,D) – 5 = 6 – 5 =1,
Tradeoff (C) = Cost(C,D) – 6 = 7 – 6 =1,
Tradeoff (D) = Cost(D,C) – 9 = 7 – 9 = -2,
Tradeoff (E) = Cost(E,C) – 5 = 9 – 5 = 4,
Tradeoff (F) = Cost(F,Nj) – 6, no possible Nj left.
Tradeoff (G) = Cost(G,D) – 6 = 11 – 6 = 5

Tradeoff (D) is the lowest. However, this is infeasible since it violates the link weight
constraint ( Wi = WC + WD + WF + WG = 1 + 2 + 1 + 1 = 5  3). The other tradeoff are
not accepted because their each cost is positive which mean link directly to the center costs
lowest. The algorithm terminates, and thus we add link (B,A), (C,A), and (D,A) to
complete the access network. The CMST from using ESAU-Williams algorithm is shown
as follow.
 A B A B

G C G E

F D F D

E C

2. Draw the CMST using packet tracer.

By using Cisco packet tracer with 1 switch and 5 hub, straight cable, CMST drawing is
shown as follow.