The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 2 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
This assignment is based on computer network.
IP and Routing part.
Â
2. IP and Routing(1) In the following figure, fill out the forwarding table at router A. Choose the shortest path in thisproblem. The cost is the hop count (note, each network, labelled by cloud, is one hop).Routing table at Router ADestination AddressCostInterfaceNext hop IP address128.4.100.0/242M1128.5.101.10(2) Is it possible to aggregate these addresses to have a smaller routing table? If so, to what? If not, whynot?(3) Now assume that the whole network 128.4.100.0/24 breaks down, and assume that the routers areusing Routing Information Protocol (RIP) with Poison Reverse. How many cycles of routing tableupdates does it take for A to find out that the network 128.4.100.0/24 is unreachable? Show all the stepsin the following table. Show each entry as the pair (next router, cost).iterationsRouter ARouter BRouter CRouter DBefore the break( B , 2 )( — , 1 )( D , 2 )( — , 1 )1234567…
Attachments: