how large this Distance vector can be

Thread Starter

lse123

Joined Oct 17, 2006
101
In Distance Vector Algorithm (RIP)
A row in routing table is itself a Distance vector, well, how large this Distance vector can be? As it’s direct links (neighbors=subnets) only?
 

thatoneguy

Joined Feb 19, 2009
6,359
RIP isn't recommended for large networks (15 Hop Max for your 'vector').

Take a look at ICMP for larger networks.

If you are working on routing between two routers, the physical distance doesn't matter, as long as it is within specs of the physical layer. If you have many routers and large tables, RIP becomes very inefficient.

BGP isn't used until you are on background links, it's designed to "route around" failures, more efficiently and quickly compared to ICMP. Do you have a network sniffer?
 

Thread Starter

lse123

Joined Oct 17, 2006
101
As DV tell, it's neighbors the cost, from it to all nodes knows about in his network area, these all data where go? in neighbors routing table or this is for only neighbors?
 

thatoneguy

Joined Feb 19, 2009
6,359
Here is the RIP RFC which explains it pretty well.

Animated RIP Simulation/Tutorial that might help.

RIP takes up a lot of bandwidth with broadcasts and routing table updates.

I have no clue why I posted "ICMP" instead of "OSPF" above, sorry for that error, Acronym Storage Area must be full. RIP isn't used much, often replaced with OSPF (Open Shortest Path First), as stated above.
 

Thread Starter

lse123

Joined Oct 17, 2006
101
again: As DV tell, it's neighbors the cost, from it, to all nodes knows about in his network area, these all data where go? in neighbors routing tables or these tables are for only neighbors data? In other words exist, separate routing tables for neighbor data and, for non-neighbor data in each router?
 
Top