Routing Information Protocol (RIP) -
hello learning networking in class , trying understand routing information protocol , there 1 example networking book follows (and same 1 can find online):
how table c change given receives above advertisement?
the rip algorithm update local row if recived table's hop count < local hop count -1.
nb. -1 due fact remote hope count not include hope local rounter.
destination subnet u: local row hop count = 1. recived row hop count = 2. recived information not decrease hop count, row remains unchanged.
subnet v: local hop count = 3. recived hop count = 2. new hop count lower not improvemtn when consider hop rounter c a. therefore unchanged
- subnet w: local hop count = 4 recived hop count = 1 path via router therefor give path fewer hops row updated. next router = (as diverting via node recived table from) new hop count = 2 (the recived 1 + hop c)
- subnet x: local hop count = 2 recieved hop count = 3 new cost larger out local copy therefore isnt changed.
only row reffering subnet w updated.
subnet desitnation = w, next rounter = a, hop count = 2.

Comments
Post a Comment