NTW T2 - Routing simulation on paperNTW T2在纸上的路由模拟.pptVIP

  • 1
  • 0
  • 约4.32千字
  • 约 42页
  • 2018-04-17 发布于江西
  • 举报

NTW T2 - Routing simulation on paperNTW T2在纸上的路由模拟.ppt

NTW T2 - Routing simulation on paperNTW T2在纸上的路由模拟.ppt

Routing Simulation on Paper Topology Each group knows about their own connections to other groups Groups do not know about connections between other groups Every group gets a different diagram RIP Simulation - Create a routing table Create a distance vector table showing routes to all destinations that you know about Table will contain: Destination (A, B, C, ...) Cost (0 for yourself, 1 for your direct neighbours, more for distant destinations) Next hop (yourself or a direct neighbour) RIP Simulation - Your routing table Your location: K Your neighbours: W and X RIP Simulation - Send copies to neighbours Make copies of your distance vector table but leave out the next hop. Just include the destination and cost Give a copy to each of your neighbours Expect to receive a copy of the distance table from each of your neighbours RIP Simulation - What you send to your neighbours Your location: K Send this to your neighbours (W and X) RIP Simulation - What your neighbour sends to you Your location: K You receive this from your neighbour (W) RIP Simulation - Update table Add 1 to every cost from your neighbour If there are any destinations that you did not have before, add them to your table (next hop is your neighbour) If your neighbour can get to a destination for lower cost than you had before, update your table to show new cost and next hop RIP Simulation - Your new routing table after update Your location: K Your neighbours: W and X Update your routing table after neighbour W sent you an update RIP Simulation - Repeat Once per minute, send a copy of your table to each neighbour Keep track of when neighbours send data to you If 4 minutes pass with no update, neighbour is dead Delete table entries that have dead neighbour as next hop OSPF Simulation - Create a link state table Create a link state table showing all links that you know about Table will contain: Both ends of link (A to B, F to H, …) Cost of link (any integer) OSPF Simulation - Your link state table Your

文档评论(0)

1亿VIP精品文档

相关文档