Homework 6 Local Access Design Given the topology

Solution to Hw#6 Solution a): Greedy MST. First sort the edge cost in increasing

Solution to Hw#6(2) Solution b) Esau-Williams Algorithm begin by computing the tradeoffs for the

Solution to Hw#6(3) Now t 32 has the lowest tradeoff value, add link (3,

Solution to Hw#6(4) The solution has a cost of 11. Both EW algorithm and

Slides: 5

Homework #6: Local Access Design Given the topology below, the weight of each node is 1, and W = 3 a) apply the greedy CMST algorithm. b) apply the Esau-Williams algorithm. Highlight the trees (components) selected. C. Edward Chow

Solution to Hw#6 Solution a): Greedy MST. First sort the edge cost in increasing order. Edge Cost CMST Decision (1, 4) 1 select (2, 3) 1 select (0, 1) 2 select (3, 5) 2 select (0, 5) 5 Select, Done! (2, 4) 5 (1, 2) 6 (1, 3) 7 (0, 2) 8 C. Edward Chow

Solution to Hw#6(2) Solution b) Esau-Williams Algorithm begin by computing the tradeoffs for the nearest neighbors of each node (since that link will have smallest cost and yield a low trade -off values): t 14 = c 14 - cc 1 = 1 - 2 = -1 t 23 = 1 - 8 = -7 t 32 = 1 - 11 = -10 t 41 = 1 - 14 = -13 t 53 = c 53 - cc 5 = 2 - 5 = -3 starting with t 41 which is the lowest tradeoff value, we add link (4, 1) to subtrees, now cc 4 = 2 since node 4 now connected to the center through node 1, find the next nearest neighbor of 1 to be 0, t 10=2 -2=0 let us now compute the tradeoff between node 4 and the next nearest neighbor to node 4 (which is node 2), t 42 = c 42 - cc 4 = 5 -2 = 3 C. Edward Chow

Solution to Hw#6(3) Now t 32 has the lowest tradeoff value, add link (3, 2) to the subtrees, now cc 3 = 8 and the next nearest neighbor to node 3 is 5, t 35 = 2 - 8 = -6 We also need to update t 23 since (2, 3) is chosen. The next nearest neighbor to node 2 is 4, t 24 = 5 - 8 = -3 Select t 35=-6, add link(3, 5) to the subtrees. N ow Cc 2=Cc 3=Cc 5=5, we need to update t 31=7 -5=2 t 24=5 -5=0 t 50=5 -5=0 Select (1, 0) add link (1, 0) to the subtrees. Reject (2, 4) since it will create a component of weight = 4. Select (5, 0) add link (5, 0) to the subtrees. Now all nodes are connected to node 0. Note that the algorithm always terminates with links whose tradeoffs are 0. We will never consider any links with positive tradeoff. C. Edward Chow

Solution to Hw#6(4) The solution has a cost of 11. Both EW algorithm and GMST find optimal solution but GMST is much faster. C. Edward Chow