Question: Question 1 . ( 1 5 points ) Consider a datagram network using 8 - bit host addresses. Suppose a router uses longest prefix matching

Question 1.(15 points) Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table:
a). Fill in the "Associated" column the 8-bit addresses (e.g.,00000011-00010000) specified by the "Destination Address Range" column.
\table[[\table[[Destination Address],[Range]],\table[[Link],[Interface]],Associated],[00************,0,],[001**********,1,],[010**********,1,],[011**********,2,],[10************,2,],[110**********,3,],[111**********,0,]]
b) Based on the forwarding table above, fill in the "Number" column the 8-bit IP addresses that will be forwarded to that interface, using the longest prefix matching. Briefly explain your answer.
\table[[Link Interface,Number],[0,],[1,],[2,],[3,]]
Question 2.(15 points) Consider a router that interconnects four subnets: Subnet 1 to Subnet 4. Suppose all of the interfaces in each of these four subnets are required to have the prefix 158,83,254,024. Also suppose that Subnet 1 is required to support at least 60 interfaces, Subnet 2 is to support at least 90 interfaces, and Subnet 3 and Subnet 4 each is to support at least 25 interfaces. Provide four network addresses (of the form a.b.c.d/x) that satisfy these constraints. Explain your answer.
Question 1 . ( 1 5 points ) Consider a datagram

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!