Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
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)
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...
See similar textbooks
icon
Related questions
Question

I need help with the last two parts, d & e. Answer for a, b, and c were provided earlier.

5. 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. а. 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. с. Assuming the same scenario as (c), write down the forwarding tables in nodes B, C, and D. d. Assuming the same scenario as (c) and if the router C is down and not reachable, write down the forwarding table on B 1 B 3 1 H1 2 4 2 H3 H2 3. b.
Transcribed Image Text:5. 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. а. 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. с. Assuming the same scenario as (c), write down the forwarding tables in nodes B, C, and D. d. Assuming the same scenario as (c) and if the router C is down and not reachable, write down the forwarding table on B 1 B 3 1 H1 2 4 2 H3 H2 3. b.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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…
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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS