networking - Numerical on Distance Vector Algorithm -


i solving assignment on routing protocols , following question came up. unable come solution. please help.

a network of 4 routers a, b, c , d arranged this:

a_____b_____c_____d    3     2     1 

the routers use distance vector routing, using number of hops metric. value “8” used routers indicate “infinity” (to conclude router unreachable).

the link c-d goes down.

a. how many exchanges require each of them conclude d unreachable? @ each exchange, show distances routers maintain router d.

b. assume routers follow split horizon. how many exchanges needed routers conclude d unreachable? @ each exchange, show distances routers maintain router d.

solution

i wrote hand, hope legible. solution part (a).


Comments

Popular posts from this blog

ios - RestKit 0.20 — CoreData: error: Failed to call designated initializer on NSManagedObject class (again) -

laravel - PDOException in Connector.php line 55: SQLSTATE[HY000] [1045] Access denied for user 'root'@'localhost' (using password: YES) -

java - Digest auth with Spring Security using javaconfig -