试验19NetSim－IP动态路由-RIPIGRPEIGRPOSPF.ppt

Iteration Node 1 Node 2 Node 3 Node 4 Node 5 Initial (3,3) (4,4) (6, 1) (3,3) (6,2) 1 (3,3) (4,4) (4, 5) (3,3) (6,2) 2 (3,7) (4,4) (4, 5) (5,5) (6,2) 3 (3,7) (4,6) (4, 7) (5,5) (6,2) San Jose 3 1 5 4 6 2 2 3 4 2 1 1 2 3 5 0 2 5 5 7 4 7 6 Node 2 could have chosen 5 as next node because of tie 3 5 4 6 2 2 3 4 2 1 1 2 3 5 1 Iteration Node 1 Node 2 Node 3 Node 4 Node 5 1 (3,3) (4,4) (4, 5) (3,3) (6,2) 2 (3,7) (4,4) (4, 5) (2,5) (6,2) 3 (3,7) (4,6) (4, 7) (5,5) (6,2) 4 (2,9) (4,6) (4, 7) (5,5) (6,2) San Jose 0 7 7 5 6 9 2 Node 1 could have chose 3 as next node because of tie 3 1 2 4 1 1 1 3 1 2 4 1 1 X (a) (b) Update Node 1 Node 2 Node 3 Before break (2,3) (3,2) (4, 1) After break (2,3) (3,2) (2,3) 1 (2,3) (3,4) (2,3) 2 (2,5) (3,4) (2,5) 3 (2,5) (3,6) (2,5) 4 (2,7) (3,6) (2,7) 5 (2,7) (3,8) (2,7) … … … … Counting to Infinity Problem Nodes believe best path is through each other (Destination is node 4) * Routing Loop Solutions 解決方案 ： 定義跳越數目最大值 分割區域 (Split Horizon) 使用「保持」計時器 (Hold-Down) 毒害反向更新(Poison Reverse Updates) Link-State Algorithm Basic idea: two step procedure Each source node gets a map of all nodes and link metrics (link state) of the entire network Find the shortest path on the map from the source node to all destination nodes Broadcast of link-state information Every node i in the network broadcasts to every other node in the network: ID’s of its neighbors: Ni=set of neighbors of i Distances to its neighbors: {Cij | j ?Ni} Flooding is a popular method of broadcasting packets Execution of Dijkstra’s algorithm Iteration N D2 D3 D4 D5 D6 Initial {1} 3 2 5 ? ? 1 {1,3} 3 2 4 ? 3 2 {1,2,3} 3 2 4 7 3 3 {1,2,3,6} 3 2 4 5 3 4 {1,2,3,4,6} 3 2 4 5 3 5 {1,2,3,4,5,6} 3 2 4 5 3 1 2 4 5 6 1 1 2 3 2 3 5 2 4 3 1 2 4 5 6 1 1 2 3 2 3 5 2 4 3 3 1 2 4 5 6 1 1 2 3 2 3 5 2 4 3 1 2 4 5 6 1 1 2 3 2 3 5 2 4 3 3 1 2 4 5 6 1 1 2 3 2 3 5 2 4 3 3 1 2 4 5 6 1 1 2 3 2 3 5 2 4 3 3 1 2 4 5 6 1 1 2 3 2 3 5 2 4 3 3 ? ? ? ? ? ? ? ? ? Shortest Paths in Dijkstra’s Algorithm 1 2 4 5