Consider the network below.
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.)
c.
Now suppose that this network is a virtual circuit network and that
there is one ongoing call between H1 and H3, and another ongoing call
between H2 and H3. 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.
d. Assuming the same scenario as (c), write down the forwarding tables in nodes B, C, and D.
a)
Taken the given data and figure:
Suppose that the forwarding table in router A, such that all traffic destined to host H3 is forwarded through interface 3 in datagram network..
It contains,
The destination address is H3 and link interface is 3.
b)
No.
It is not possible for 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.
c)
Suppose that this network is a virtual circuit network and that there is one ongoing call between H1 and H3, and another ongoing call between H2 and H3.
After clear observations, the 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 is as follows:
Incoming Interface |
Incoming VC# |
Outgoing Interface |
Outgoing VC# |
1 |
12 |
3 |
22 |
2 |
63 |
4 |
18 |