Address rang datagram network using bit host addresses

CSC358: Tutorial 8

Principles of Computer Networks

a)Suppose that this network is a datagram network. Show the forwarding table in router A, such that all traffic destined to host H3 is forwarded through interface 3.

b)Suppose that this network is a datagram network. Can you write down a forwarding table in router A, such that all traffic from H1 destined to host H3 is forwarded through interface 3, while all traffic from H2 destined to host H3 is forwarded through interface 4? (Hint: this is a trick question.)

a)Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces.

b)Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses:

Problem 3. Address Rang:

Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table:

2

CSC358: Tutorial 8

3