This preview shows page 1. Sign up to view the full content.
Unformatted text preview: o Dynamic Routing link costs change rapidly due to traffic loads, or change in topology. o Load sensitive link costs keep changing due to changing congestion. o Load insensitive link cost does not explicitly reflect changing traffic loads. Internet has load-insensitive routing. Dijkstras Algorithm o Terminates after each node is put into N. o If link states are changing according to traffic load To avoid synchronization, each link can send out its link state advertisements randomly. Distance Vector Algorithm o Each node receives some information from its direct neighbors, performs a calculation and sends the info back out to neighbors. o Asynchronous no need for all nodes to operate at same time. o Self-terminating. LS and DV Algorithm Comparison...
View Full Document
This note was uploaded on 02/05/2009 for the course ECE 4450 taught by Professor Wicker during the Fall '07 term at Cornell University (Engineering School).
- Fall '07
- Computer Networks