Question

1. Neighboring routers J and K use the RIP routing protocol

The original routing table (simplified for the purpose of this problem) in K is:

Destination	Distance	Route
Net 1	1	direct
Net2	2	J
Net 3	8	M
Net 4	5	M
Net 5	6	J
Net 6	5	Q

The update from J is:

Destination	Distance
Net 2	3
Net 3	4
Net 4	2
Net7	5

Show the contents of the routing table in K after it has been revised to reflect the information from J.

Answer 1

Count-LQ111 be Consol ered as the ltst 、rule 9 the route colh, least-nunle) o手, distance (hops) best route to seach dlectimcuion neltoork Now!卓cr Net-LIK has already, len, ned lhaHo

Noo tor Nets ,k has dean fstance. jore oul ιρ ared ag、TOuRnOg table. 04. įs shocaintr Jesson dlifance. ie it- For Ner4,"Hee distance learned berk İSS_ and distance acluentised ìs 2-thenesove it-caiu get upotaard fable as k has no lened route beore 2istance Roufe teh- Ne-3 A- 2一 Netb Nett