第二讲路由器结构及路由协议

Dijkstra’s algorithmperformanceAlgorithm complexity (n nodes andl links)Computation– n iterations– each iteration: need to check all nodes, w, not in N– n*(n+1)/2 comparisons: O(n 2 )– more efficient implementations possible: O(n log n)Messages– network topology and link cost known toall nodes– each node broadcasts its direct link cost