Consider the network below. Suppose that this network is a datagram network. Show the forwarding table in router D, such that all traffic destined to host H1 is forwarded through interface 1. а. 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.) 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 4, while all traffic from H2 destined to host H3 is forwarded through interface 3. с. d. Assuming the same scenario as (c), write down the forwarding tables in nodes B, C, and D. Assuming the same scenario as (c) and if the router C is down and not reachable, write down the forwarding table on B е.
Consider the network below. Suppose that this network is a datagram network. Show the forwarding table in router D, such that all traffic destined to host H1 is forwarded through interface 1. а. 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.) 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 4, while all traffic from H2 destined to host H3 is forwarded through interface 3. с. d. Assuming the same scenario as (c), write down the forwarding tables in nodes B, C, and D. Assuming the same scenario as (c) and if the router C is down and not reachable, write down the forwarding table on B е.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
I need help with the last two parts, d & e. Answer for a, b, and c were provided earlier.
![### Network Exercise
Consider the network below.
**a.** Suppose that this network is a datagram network. Show the forwarding table in router D, such that all traffic destined to host H1 is forwarded through interface 1.
**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 4, while all traffic from H2 destined to host H3 is forwarded through interface 3.
**d.** Assuming the same scenario as (c), write down the forwarding tables in nodes B, C, and D.
**e.** Assuming the same scenario as (c) and if the router C is down and not reachable, write down the forwarding table on B.
---
### Network Diagram Description
The diagram shows a network with the following components:
- **Hosts:** H1, H2, and H3.
- **Routers:** A, B, C, and D.
- **Connections:**
- H1 is connected to router A.
- H2 is connected to router A.
- Router A is connected to Router B (interface 1), Router D (interface 2), and Router C (interface 3).
- Router B is connected to Router A (interface 1) and Router D (interface 2).
- Router C is connected to Router A (interface 1) and Router D (interface 2).
- Router D is connected to Router B (interface 1), Router C (interface 2), Router A (interface 3), and Host H3.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2191ff5f-0867-4682-9559-0b1c4e7ecbac%2Fe6840d9a-311a-4605-bd2d-67058d764ced%2F2k8kmx_processed.png&w=3840&q=75)
Transcribed Image Text:### Network Exercise
Consider the network below.
**a.** Suppose that this network is a datagram network. Show the forwarding table in router D, such that all traffic destined to host H1 is forwarded through interface 1.
**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 4, while all traffic from H2 destined to host H3 is forwarded through interface 3.
**d.** Assuming the same scenario as (c), write down the forwarding tables in nodes B, C, and D.
**e.** Assuming the same scenario as (c) and if the router C is down and not reachable, write down the forwarding table on B.
---
### Network Diagram Description
The diagram shows a network with the following components:
- **Hosts:** H1, H2, and H3.
- **Routers:** A, B, C, and D.
- **Connections:**
- H1 is connected to router A.
- H2 is connected to router A.
- Router A is connected to Router B (interface 1), Router D (interface 2), and Router C (interface 3).
- Router B is connected to Router A (interface 1) and Router D (interface 2).
- Router C is connected to Router A (interface 1) and Router D (interface 2).
- Router D is connected to Router B (interface 1), Router C (interface 2), Router A (interface 3), and Host H3.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY