Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has

Question:

Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table:
Prefix Match Interface
1............................ 0
10........................... 1
111......................... 2
otherwise.................. 3
For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Computer Networking A Top-Down Approach

ISBN: 978-0136079675

5th edition

Authors: James F. Kurose, Keith W. Ross

Question Posted: