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

Comptia A+ Core 1 Exam: Guide To Computing Infrastructure (mindtap Course List)

10th Edition

ISBN:9780357108376

Author:Jean Andrews, Joy Dark, Jill West

Publisher:Jean Andrews, Joy Dark, Jill West

Chapter8: Network Infrastructure And Troubleshooting

Section: Chapter Questions

Problem 8TC

See similar textbooks

Similar questions

P1. 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? (Hint: This is a trick question.)
Consider a computer 1 that communicates with a computer 2 via LAN1, router R1, and LAN2. The sending computer1 is running two processes at this time with port addresses k and l. The receiving computer 2 is running three processes at this time with port addresses f, g and h. Process k in the sending computer 1 needs to communicate with process g in the receiving computer 2. Draw the network and show the contents of segments, packets and frames at the network, data link, and transport layer for each hop. Note: Computer 1 has: Physical address=15, Logical address=A Router R1 has: Physical address in the side of LAN 1=20, Logical address in the side of LAN1=B Physical address in the side of LAN 2=50, Logical address in the side of LAN2=D. Computer 2 has: Physical address=77, Logical address=E.
In the above network diagram, IP and MAC addresses are given for network nodes. Suppose Host1 (Shahid) sends a datagram to Host2 (Khalid). What IP and MAC addresses (source and destination) will be written in IP and Data link layer headers respectively, for the following intermediate points from Host1 to Host2?a) Host1 to Router1 (R1)b) Router1 to Router2 (R2)c) Router2 to Host2
Consider the network shown below, and Dijkstra’s link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A?
Consider the extended LAN connected using bridges B1 and B2 in the Figure given below. H1 shown in the figure is a hub which has the property of taking an input on one port and forwarding it on all other ports. Suppose the forwarding tables in the two bridges are empty. List all ports on which a packet will be forwarded by bridges B1 and B2 for the following sequence of data transmissions: a) A sends a packet to C b) E sends a packet to F c) F sends a packet to E d) G sends a packet to E e) D sends a packet to A f) B sends a packet to F
a) For the given network diagram, suppose an application running on Host 1 transmits a packet towards application running on Host 2. Graphically represent the process of packet encapsulation and de-capsulation along the path from Host 1 to Host 2.b) Both Layer-2 Switch and Router are used to forward network traffic from one interface to another. How are they different in terms of functionality?
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?
Consider the network setup in Figure 1. Suppose that the ISP assigns the router a public address of 44.33.111.245 and the network address of the home network is 192.168.1/24.Figure 1a. Assign addresses to all the interfaces of the router. (Consider router to be the respectable candidate for the first address in the home network, and let’s assign the addresses to the hosts in the order after that.)b. Suppose each host has two ongoing TCP connections, all to port 80 at host 123.34.56.78. Provide the six corresponding entries in the NAT translation table (Image 2). Use only dynamic ports for NAT purpose. (Hint: Choose Port Numbers in the range (and in the order) 50000 to 50005 for WAN side and 60000 to 60005 for LAN side addresses e.g. 50000 for connection1, 50001 for connection2 of Host1, and so on.
QUESTION 21 SDN (software driven network) router can act as a traditional router True False 5 points QUESTION 22 SDN (software driven network) router can act as a switch True False 5 points QUESTION 23 SDN (software driven network) router can act as a NAT True False 5 points QUESTION 24 SDN (software driven network) router can not act as a NAT True False 5 points QUESTION 25 Suppose two packets arrive to two different input ports of a router at exactly the same time. Also suppose there are no other packets anywhere in the router Suppose the two packets are to be forwarded to two different output ports. Is it possible to forward the two packets through the switch fabric at the same time when the fabric uses switching via memory? True False
According to the given figure, assume that, PC0 wants to send a message to PC4. If the distance between the two points is 22,000 km, 3.2-kbyte message sends in 2.4 x 100000000 mls speed through cable and the transmission link has 1.5 Gbps Bandwidth. When the message arrives at Routers , Router0 already has 4 packets to process in the queue and each will need 2ms. Router1 has no packets in the queue, but if it had then would require 3ms to process. Router2 already has 5 packets to process in the queue and each will need 1ms. Calculate the total time to send the message from PC0 to PC4.
Assume that there are two routers, each router is connected with pc A and pc B. Find the number of node-to-node delivery, process-to-process delivery and draw the packet format by enabling weighted fair queuing.
Given, a network address of 161.0.0.0/10. Using the figure above and by applying VLSM technique, find the network address of the subnets A, B and C. Where Subnet A has 2788 hosts, Subnet B has 484 hosts and Subnet C is the switched network interconnecting the routers. Upload Picture Please