Problem $1$

A corporation has seven networks connected by five routers as shown in the above figure. All five routers use the distance$-$vector RIP algorithm. The routing table in each router has three fields: a destination network IP address, the distance $($cost$)$ to reach this destination and the next hop. Assume the following: i$)$ RIP uses Split Horizon with Poisoned Reverse, ii$)$ the cost to reach a host in a network directly connected to a router is $1$ hop and iii$)$ if a router discovers multiple routes to the same destination with the same cost, it selects the route whose next hop is the router with the highest Id$.$ Give the shortest path information sent by router R$4$ to the two neighboring routers R$3$ and R$5$ shortly after convergence of all routing tables is achieved.

Problem $2$ Consider a network topology obtained by adding a direct connection between router R$1$ and network Net $2$ in the network topology of problem $(2).$ All routers use the OSPF algorithm with cost of $1$ for each hop $($similar to RIP$).$ The OSPF algorithm executes in these networks with the ECMP option enabled. Each host has a default gateway $($router$)$ to which it sends all the non$-$local outbound packets. If a network has multiple routers connected to it$,$ the default router for hosts in this network is the one that has the highest Id $($note: inbound packets are delivered to their destination hosts directly by anyone of these multiple routers$).$ Seven long$-$living UDP streams operate between the following senderdestination pairs: $($H$1$H$7),($H$2$H$4),($H$3$H$6),($H$4$H$5),($H$5$H$3),($H$6$H$1)$ and $($H$7$H$2)$ Each stream sends packets at a rate of $600$ packets per second where each packet has a size of $1250$ bytes. If each of the seven networks has a bandwidth of $100$ Mbps$,$ rank these networks in ascending order of their steady state utilization. Utilization of a network is the ratio between the actual traffic transported by this network in one second and the announced bandwidth of this network.