a.
Figure 6.33:
The “Figure 6.33” contains:
- Two routers.
- Three switches (LAN).
- Three subnets.
- Each subnet contains two host computers.
- Subnet 1 contains two hosts named “A” and “B”. Both the two hosts are connected through a same switch.
- Subnet 2 contains two hosts named “C” and “D”. Both the two hosts are connected through a same switch.
- Subnet 3 contains two hosts named “E” and “F”. Both the two hosts are connected through a same switch.
Given consideration:
Consider that the switch is placed between Subnet 1 and Subnet 2, and the Router between them is named as R1.
b.
Explanation of Solution
Given: Consider the Host E needs to send a datagram to the Host B. Also, The Host E’s ARP cache does not holds B’s MAC address.
To find:
- Will the Host E execute ARP query to find the Host B’s MAC address.
- Source and destination IP and MAC addresses of the Ethernet frame that contains the IP datagram destined to B.
Solution:
“No”, the Host E do not executed ARP query to find out the MAC address of the Host B because, they are not on the common LAN...
c.
Explanation of Solution
Solution:
Actions of the switch S1:
The Switch 1 (S1) will program the Ethernet frame through its interfaces. The received ARP frame’s destination address is the broadcast address. It finds out that the Host A lives on Subnet 1 which is connected to the switch S1. The Switch S1 will then update its forwarding table to get an entry for Host A.
Router receives ARP request message:
“Yes”, the router R1 gets an ARP request message but this router will no forward the information to Subnet 3...
Want to see the full answer?
Check out a sample textbook solutionChapter 6 Solutions
EBK COMPUTER NETWORKING
- In this question we consider a router that has to fragment an IP datagram to make it fit into a link with an MTU smaller than the datagram's original size. Assume the MTU for an outgoing link is 1,740 bytes and the datagram we want to transmit has a total length of 4,500 bytes (including 20 bytes of IP header!). What is the offset value for the second datagram sent by the router? Your Answer:arrow_forward3. The figure below shows a network of four clients: A, B, C, and D, connected through a router, X. The transmission rate of each device and length of each link are shown on the figure. In addition, the processing delay of the router is 200ms. At t = 0, clients A, B, and C each send a packet of size 2 Mbits to Client D (through the router X). Assume that the propagation speed over all links is 2 x 108 m/s and the router's queue (buffer) is empty. Calculate the total delay for each packet until they are received at D. R₁ = 1 Mbits/s C B Rc=3 Mbits/s 4000 Km 4000 Km 4000 Km Processing delay = 200 ms R = 10 Mbits/s 6000 Km RB = 2 Mbits/s X Darrow_forwardIn the figure below a router is transferring packets, each of length L= 5 000 bits over a link with a transmission Rate R= 1 Mbps to another router at the other end of the link. The speed prorogation of the light signal on the link is 3x108 m/s. The length of the link is 1 Km. L: packet length (in bits) R: link transmission rates (Mbps) Queue of packets waiting for output link 1-Calculate the total transmission delay. 2- How many packets can be transmitted in one second.arrow_forward
- An Internet user would like to transfer a message from his computer (host A) to another computer (host B). The size of the message passed to the IP layer is 3800 bytes. The datagram(s) carrying the message will have to cross two routers (R1 and R2) and 3 networks (NET1, NET2, and NET3) as described in the above figure. Each of these networks has a specific MTU (for example the MTU of network 1 is 1500 bytes. MTU here stands for Maximum Transmission Unit, the largest data that a frame can carry). Fill the table with the IP datagram(s) needed right after passing through NET3 (no need to show your fragmentation for N1 or N2). Assume a 2-byte options in the header. Show all your details (for partial points in case your numbers are incorrect). NET1 MTU=1500 R1 NET2 MTU=640 R2 NET3 MTU 1500 V BIU Fragment # Format Offset Flag (3 bits) Data Length Total Length ...arrow_forwardB. Consider a scenario where a packet is sent from PC1 to PC2, answer the following questions: Fa0 Gig0/1 Gig0/0 Gig0/0 Gig0/1 Fa0 2911 Shinas Router PC-PT 2911 PC-PT Bhernet A Bhernet B Ethernet C PC1 IbrRouter PC2 B1. What is the source IP address while the packet travels through Ethernet C?arrow_forwardSuppose, we have a network which is consists of two layer-2 switch, one layer-3 switch and two end devices. If we want to transfer data from this network to another established network which is consists of router, switch and end devices, can it be possible? Explainarrow_forward
- 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…arrow_forwardDefined the STP protocol? Then, write the number of the Maximum loops that should be stopped by STP protocol for the network shown in Figure 1 and identify every stopped loop by a circle. Router 1 Router 2 Router 3 Switch 5 Switch 1 Switch 2 Router 4 Switch 6 Switch 7 Switch 3 Switch 4 Figure (1).arrow_forwardConsider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.1.17/24. Also suppose that Subnet 1 is required to support up to 25 interfaces, Subnet 2 is to support up to 50 interfaces, and Subnet 3 is to support up to 75 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraintsarrow_forward
- A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,200 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?arrow_forwardConsider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.10.128/24. Also suppose that Subnet 1 is required to support at least 50 interfaces, Subnet 2 is to support at least 100 interfaces, and Subnet 3 is to support at least 12 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints.arrow_forward
- Comptia A+ Core 1 Exam: Guide To Computing Infras...Computer ScienceISBN:9780357108376Author:Jean Andrews, Joy Dark, Jill WestPublisher:Cengage LearningA+ Guide To It Technical SupportComputer ScienceISBN:9780357108291Author:ANDREWS, Jean.Publisher:Cengage,A+ Guide to Hardware (Standalone Book) (MindTap C...Computer ScienceISBN:9781305266452Author:Jean AndrewsPublisher:Cengage Learning
- Principles of Information Security (MindTap Cours...Computer ScienceISBN:9781337102063Author:Michael E. Whitman, Herbert J. MattordPublisher:Cengage LearningSystems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning