• Home
  • Blog
  • simulation of the routing process

simulation of the routing process

0 comments

Exercise: You will write a simple program to simulate the routing decision taken at a router that we discussed
in the lectures. You are given a text file (RoutingTable.txt) containing a routing table for a router (the five
column generic routing table with mask, destination address, next hop, flag and interface). You will notice
that this is almost the same routing table as the one that we discussed in the lectures. The first few lines of the
text file are shown below:

192.168.1.0/24 → Destination address/Number of ones in the mask

– → – means no next hop

E0 → Outgoing interface
192.168.2.0/24 → Destination address/Number of ones in the mask

192.168.4.2 → Next hop

S0 → Outgoing interface
Etc.

Notice that three rows are sufficient to capture the information in the five columns of the routing table. The
type of entry (direct, network specific, host specific or default) is not given but you can determine that from
the given information.

About the Author

Follow me


{"email":"Email address invalid","url":"Website address invalid","required":"Required field missing"}