Answered step by step
Verified Expert Solution
Question
1 Approved Answer
1. (30 points) Consider the network in the figure below consisting of routers (R1 - R5) and L2 subnets. Router interfaces are labeled with uppercase
1. (30 points) Consider the network in the figure below consisting of routers (R1 - R5) and L2 subnets. Router interfaces are labeled with uppercase letters, thick lines labeled with a prefix denote the L2 networks. 0.0.0.0/0 default route) 132.177.2.0/24 132.177.0.0/24 132.177.1.0/24 132.177.3.0/24 R4 R5 132.177,4.0/25 132.177,4.128/25 132.177.5.0/24 a. Assume that the network uses static routing and fill the routing tables of each route so that every subnet as well as the default gateway are reachable from any place on the network. Do it with the smalest number of entries in the routing tables. For simplicity, assume that a routing table entry consists of a prefix and the local interface on which the packet needs to leave the router (e.g., in R1 you will have entry 132.177.3.0/24 -> B, meaning any packet routed by R1 and destined to subnet 132.177.3.0/24 will be sent out on R1's interface B) b. Assume that router R5 is down. The network runs a distance vector routing protocol and that has converged (all routers have correct routes for the reachable subnets). R5 is then brought up. Show the steps by which R5 populates its routing tables and steps by which other routers learn about R5 and the L2 network connected to it. 1. (30 points) Consider the network in the figure below consisting of routers (R1 - R5) and L2 subnets. Router interfaces are labeled with uppercase letters, thick lines labeled with a prefix denote the L2 networks. 0.0.0.0/0 default route) 132.177.2.0/24 132.177.0.0/24 132.177.1.0/24 132.177.3.0/24 R4 R5 132.177,4.0/25 132.177,4.128/25 132.177.5.0/24 a. Assume that the network uses static routing and fill the routing tables of each route so that every subnet as well as the default gateway are reachable from any place on the network. Do it with the smalest number of entries in the routing tables. For simplicity, assume that a routing table entry consists of a prefix and the local interface on which the packet needs to leave the router (e.g., in R1 you will have entry 132.177.3.0/24 -> B, meaning any packet routed by R1 and destined to subnet 132.177.3.0/24 will be sent out on R1's interface B) b. Assume that router R5 is down. The network runs a distance vector routing protocol and that has converged (all routers have correct routes for the reachable subnets). R5 is then brought up. Show the steps by which R5 populates its routing tables and steps by which other routers learn about R5 and the L2 network connected to it
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started