5.08. How to forward to a border router? Consider the network shown below. Suppose AS1, AS2, AS3, and AS4 are running OSPF for their intra-AS routing protocol and that all links have a weight of 1. Initially suppose there is no link between AS2 and AS4. Once router 1d learns about destination x, it will need to install a forwarding table entry to x. Indicate which one of the statements below are true. AS 4 4a 2c 3b 2b AS 3 1c AS 2 AS 1 1a 21 O 1d will forward along z1 since OSPF has computed the path to 1c is via z1. O 1d will forward along z2 since OSPF has computed the path to 1c is via z2. O 1d will forward along z1 since BGP has computed the path to 1c is via z1. O 1d will forward along z2 since BGP has computed the path to 1c is via z2. O 1d will forward along z1 since hot potato routing forwards clockwise.

5.08. How to forward to a border router? Consider the network shown below. Suppose AS1, AS2, AS3, and AS4 are running OSPF for their intra-AS routing protocol and that all links have a weight of 1. Initially suppose there is no link between AS2 and AS4. Once router 1d learns about destination x, it will need to install a forwarding table entry to x. Indicate which one of the statements below are true. AS 4 4a 2c 3b 2b AS 3 1c AS 2 AS 1 1a 21 O 1d will forward along z1 since OSPF has computed the path to 1c is via z1. O 1d will forward along z2 since OSPF has computed the path to 1c is via z2. O 1d will forward along z1 since BGP has computed the path to 1c is via z1. O 1d will forward along z2 since BGP has computed the path to 1c is via z2. O 1d will forward along z1 since hot potato routing forwards clockwise.

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

We have 5 routers labled A-E. Suppose we have the forwarding tables shown below after the routingalgorithm is stable. Let all links have cost 1. a. If a message is originated from A and a destination is E. Which path does it take?b. If a message is originated from C and a destination is D. Which path does it take?c. Give a diagram of a possible network consistent with these tables.
Consider the following diagram: A,B,C and D are subnets, R1, R2, and R3 are routers. Default signifies theentire rest of the internet. All 4 subnets each contain the same number of hosts.Consider the following routing table at R3: CIDR Mask Link 0.0.0.0/0 L4 128.4.6.0/24 L3 128.4.8.0/24 L5 1. If 128.4.6.0 is in A, what is the routing table at R1? 2. The ISP that owns all these networks is short on IP addresses, so theyuse a NAT router for R2. How many public IP addresses will C andD use together assuming they use as many private 10.X IP addresses asthey can? How many total public IP addresses will be used by the entirenetwork? Why doesn’t the ISP care about how many private IP addressesare used? 3. Fix R3’s routing table now that we are using NAT: 4. A node in C is given the IP address 10.0.0.1 and only sends and receivespackets on port 1234. A packet destined for this node reaches R2 witha source of (IP=128.4.6.6, Port=3000) and destination of (IP=128.4.8.0,Port=10000).…
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.
Using packet tracer, implement a network that has the following components: 1- At least five routers 2- At least 7 subnets 3- At least 12 PCs 4- At least 4 switches 5- Use RIP routing protocol To assign IP addresses of the routers and PCs, use the IP address from your ID as follows Assume your id is 118zyxw, Consider the numbers z, y, x and w as deciemal You have the subnet 118.0.0.0/24 If your ID is 1181234 then the IP is 118.0.0.0/24 Use this subnet to get at least 7 subnets.
Supposed the scenario bellow, we have 3 networks to be submitted with the ip address 192.171.0.0/16. Network 1 has 150 host, network 2 has 100 and network 3 has 7 host. VLSM Decompose the given ip address to these networks using VLSM, and write the ip adress and the subnet mask for router 1, switch 0 , switch 2 , switch 3 , PC0 , PC1 , PC2
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 2 small ISPs Y and Z and two large ISPs A and B. Y pays A (but not B) to connect it to the rest of the Internet, while Z pays B (but not A) for its connectivity If ISP A learns of a path to some prefix via ISP B and ISP Z, should it advertise that path to ISP Y? Why or why not?
Computer Science Suppose We Are Going To Import A Capture Dump File Via WIRESHARK(Networking Analysis) Version 3.6.0 Show all steps on how to solve the following problems: A) Explore specific packet number let's suppose number 4 and give its source IP and MAC addresses (Show How To Do It With Steps - ScreenShots) B) Identify the Application protocols used in the communication (Show How To Do It With Steps - ScreenShots) C) Filter all TCP traffic and identify the login name and password (Show How To Do It With Steps - ScreenShots)
Consider a scenario in which Host A and Host B want to send messages to Host C. Hosts A and C are connected by a channel that can lose and corrupt (but not reorder) messages. Hosts B and C are connected by another channel (independent of the channel connecting A and C) with the same properties. The transport layer at Host C should alternate in delivering messages from A and B to the layer above (that is, it should first deliver the data from a packet from A, then the data from a packet from B, and so on). Design a stop-and-wait-like error-control protocol for reliably transferring packets from A and B to C, with alternating delivery at C as described above. Give FSM descriptions of A and C.
q no 5: 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? Host1 to Router1 (R1) Router1 to Router2 (R2) Router2 to Host2
AS1 has the following routing table, draw the network of AS’s that these paths imply: Picture below. What AS is P1 in? What about P2? What about P3? If AS3 were to stop forwarding packets for AS1, which prefixes would AS1 no longer be able to reach? Which other AS’s would be candidates to come to a new agreement with that would allow reaching those prefixes? What is one reason that AS5 might not take packets from AS1 destined for P2 directly?
10. Refer to the exhibit. PC1 issues an ARP request because it needs to send a packet to PC3. In this scenario, what will happen next?