Consider the network shown in the figure below, and assume that each node initially knows  the costs to each of its neighbors. If the distance-vector algorithm is used by all the routers, what would  be the distance table entries at node E?

c) Given graph G=(N,E), where N is the set of routers and E is the set of links. Using Dijkstra's link-state routing algorithm compute the least cost path from node U to all other nodes and show the resulting least-cost-path tree from U. Show all calculations to get full credit. 1 2 3 2 3 3 2 2

If we have a regular queue (X) and a queue (Y) that is using weighted fair queuing with a weight equal to 2. Given the following data:   Queue Packet Arrival Time Length        X A 0 10               X B 3 8                 Y C 5 8                 Y D 7 10                  What is the output order of the packets? Show your work.

In the node a  find the table using distance vector routing algorithm