Activity 3 Routing

Lets look at a conceptual network that has some costs associated with each link. You are the routing algorithm and have to find the best path through the network. Given the following circuit diagram and the cost for each circuit.

What is the least cost path for communications between point A and Z?

What path has the minimum amount of hops?

- D - - - E - - - - F - -

- - -

- - -

A - - - - - - G - - - - - - - - Z

- -

- -

H - - - - - - - - I - -

Link Cost

A - D - 2

D - E - 7

E - F - 1

F - Z - 3

A - G - 8

E - G - 1

G - Z - 7

A - H - 6

H - I - 4

I - Z - 2