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 е. H1 4 H3 H2

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 е. H1 4 H3 H2

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: We have 5 routers labled A-E. Suppose we have the forwarding tables shown below after the routing…

A: To send a message from A to E , the least possible cost is 2 and there are two paths having cost 2…

Q: P1. Consider the network below. a. Show the forwarding table in router A, such that all traffic…

A: Host: A host is a computer system or any device connected to other system or device in a network…

Q: uppose AS3 and for their intra-AS routing protocol. Suppose AS1 is running RIP for its intra-AS…

A: All 3 answers are explained below in detail

Q: as a possible congestion control mechanism in a subnet using virtual circuits internally, a router…

Q: Consider the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's…

A: The above question is solved in step 2 :-

Concept explainers

Types Of Protocols

A network protocol is a collection of rules that governs the exchange of data between devices connected to the same network. In other words, network protocols are rules that specify how devices communicate or transfer data over a network. The sender and receiver systems must obey the standards to facilitate communication between them.

Question

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

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!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

21. Consider the network below. a. Show the forwarding table in router A, such that all traffic destined to host H3 is forwarded through interface 3. b. 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? H1 H2 1 2 3 1 2 2 1 2 H3
1. Consider a path from host A to host B through a router X as follows: A- -X-B The capacity of the link AX is denoted Ra, while the capacity of the link XB is denoted Rb in units of [bits/s]. Assume that Ra Ri. Is it possible that the second packet queues at input queue of the second link? Explain. Now suppose that host A sends the second packet T seconds after sending the first packet. How large must T be to ensure no queueing before the second link? Explain.
2. Consider a slotted TDM hierarchical network in which there are 8 computers sharing a 10 Mbps channel to a router R1, sending packets to R1 which must all be forwarded by R1 over an outgoing link (called the MAN link), as shown in Figure 1. Computers A-H always have packets waiting to be sent, so no timeslot on the shared LAN is idle. Ignore the propagation delay on the LAN. The MAN link outgoing from R1 is a 100 Mbps link. The network layer protocol in use has a PDU with exactly 40 bytes of header and exactly 200 bytes of payload (SDU). The DLC layer protocol in use on the LAN has a PDU with exactly 40 bytes of header and 20 bytes of trailer. The DLC layer protocol in use on the outgoing link from R1 has a PDU with 40 bytes of header and no trailer. The physical layer does not impose any bit overhead in either channel. Use 1 Mbps = 1000000 bps. B D E F G H R1 R2 Figure 1 (a) What is the transmission delay of a bit for Computer A? (b) What is the transmission delay of a DLC PDU for…
2. Now suppose there are two links between source and destination, with one router connecting the two links. Each link is 5,000 km long. Again suppose the MP3 file is sent as one packet. Suppose there is no congestion, so that the packet is transmitted onto the second link as soon as the router receives the entire packet. What is the end-to-end delay?