Consider the network below. a) Suppose that this network is a datagram network. Show the forwarding table
Question:
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 HI destined to host H3 is forwarded through interface 3, while all traffic from H2 destined to host H3 is forwarded through interface 4? (This is a trick question.)
c) Now suppose that this network is a virtual circuit network and that there is one ongoing call between HI and H3, and another ongoing call between H2 and H3. Write down a forwarding table in router A, such that all traffic from HI 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.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Computer Networking A Top-Down Approach
ISBN: 978-0136079675
5th edition
Authors: James F. Kurose, Keith W. Ross
Question Posted: