1 / 52

Announcement

Announcement. Midterm. Chapter 2 and 3 (see Reading List for details) Lab 1, 2, and 3. Midterm. 1 A4-size Cheat Sheet Some MCQ/Short Questions. Problem Set 4. Clarification on Q3 Posted. Application. Transport. you are here. Network. Link. Physical. Transport

ella
Download Presentation

Announcement

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. Announcement

  2. Midterm Chapter 2 and 3 (see Reading List for details) Lab 1, 2, and 3

  3. Midterm 1 A4-size Cheat Sheet Some MCQ/Short Questions

  4. Problem Set 4 Clarification on Q3 Posted

  5. Application Transport you are here Network Link Physical

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

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

  8. Routing

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

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

  11. Intra-AS routing Inter-AS routing

  12. Addr Interface X Y Z 1 1 3

  13. 4,294,967,296

  14. Prefix Interface 11001 110 011 1 2 3

  15. Abstract View of Routing

  16. 1 2 4 1 2 3 7 2 2

  17. Shortest Path Problem in Graph

  18. Link-State Routing Centralized, using Dijkstra algorithm

  19. broadcast costs of links to each other

  20. compute shortest paths locally (using global map)

  21. Distance Vector Routing Distributed Asynchronous Iterative Self-Terminating

  22. exchange “local views” with neighbors

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

  24. y x

  25. y x

  26. Bellman-FordEquation

  27. v y x

  28. 7 v 9 y 5 2 8 x 4

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

  30. Dest Next y v*

  31. Distance Vector

  32. 1 2 y 7 x z

  33. 1 2 y 7 x z

  34. 5 1 y 2 w 2 7 x z

  35. 1 4 y 50 x z

  36. 1 4 y 50 x z

  37. “Count-To-Infinity” Problem

  38. PoisonedReverse

  39. DV LS

  40. 1 4 y 50 x z

  41. RIP Routing Information Protocol

  42. Routing Table

  43. Exchange every 30 seconds(over UDP)

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

  45. “static routing”“load insensitive”

  46. Intra-AS routing Inter-AS routing

More Related