QUESTION

Consider a network with $8$ routers, where each link has an integer weight $($e$.$g$.,$ the link between r$1$ and

r$2$ has weight $2).$ Assume that link capacities are $10$Mbps$.$ There are $7$ different traffic flows from r$1$ to all

the other nodes in the network, where the traffic rate for each flow is $2$Mbps $(2$Mbps traffic flow from

r$1$ to $2,2$Mbps traffic flow from r$1$ to r$3,$ so on$).$

$($i$)$ Show the steps of Dijkstra and Distance Vector $($Bellman$-$Ford$)$ algorithms to find the shortest paths for r$1.$

$($ii$)$ What is the average hop$-$count of all the routes in the network?

$($iii$)$ Calculate the link utilizations for all links. Assume Equal Cost Multi Path is enabled. Is there any congested

link?

$($iv$)$ Discuss possible Traffic Engineering techniques to alleviate the congestion when connection$-$oriented and

connectionless technologies are used.

$($v$)$ Provide a new set of link weights such that none of the links in the network is congested $($Link utilization is

less than $1).$ Calculate the link utilizations for all links. Assume Equal Cost Multi Path is enabled.