1 / 45

Application

Application. Transport. you are here. Network. Link. Physical. Transport (process-to-process). Network (host-to-host). Link (node-to-node). Transport (process-to-process). Network (host-to-host). IP. ICMP. Routing Protocols. Link (node-to-node). Routing.

deiondre
Télécharger la présentation

Application

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Application Transport you are here Network Link Physical

  2. Transport (process-to-process) Network (host-to-host) Link (node-to-node)

  3. Transport (process-to-process) Network (host-to-host) IP ICMP Routing Protocols Link (node-to-node)

  4. Routing

  5. Internet is a “network of networks” A hierarchy of ISPs (Tier 1, 2, 3), each owns routers and links

  6. Internet is a “network of Autonomous Systems” A hierarchy of ISPs (Tier 1, 2, 3), each owns routers and links

  7. Intra-AS routing Inter-AS routing

  8. Abstract View of Routing

  9. 1 2 4 1 2 3 7 2 2

  10. Least Cost Path Problem in Graph

  11. Link-State Routing Centralized, using Dijkstra algorithm

  12. broadcast costs of links to each other

  13. compute shortest paths locally (using global map)

  14. Distance Vector Routing Distributed Asynchronous Iterative Self-Terminating

  15. exchange “local views” with neighbors

  16. update “local views” (based on neighbors’ view)

  17. y x

  18. y x

  19. Bellman-FordEquation

  20. v y x

  21. 7 v 9 y 5 2 8 x 4

  22. 7 9 y 5 v* 2 8 x 4

  23. Dest Next y v*

  24. Distance Vector

  25. 1 2 y 7 x z

  26. 1 2 y 7 x z

  27. 5 1 2 y w 2 7 x z

  28. 1 4 y 50 x z

  29. 1 4 y 50 x z

  30. “Count-To-Infinity” Problem

  31. PoisonedReverse

  32. DV LS

  33. 1 4 y 50 x z

  34. RIP Routing Information Protocol

  35. Routing Table

  36. Exchange every 30 seconds(over UDP)

  37. RIP “Self-Repair” if no ad from n for 180s assume n has failed

  38. “static routing”“load insensitive”

  39. Intra-AS routing Inter-AS routing

  40. BGP Border Gateway Protocol

More Related