1 / 10

Network Layer

Explore fundamental concepts in networking, focusing on routing tables, subnetting, Dijkstra’s algorithm, and NAT. Understand destination address ranges, link interfaces, and the longest prefix matching. Learn about subnetting techniques with examples, and how to find the number of addressable hosts using bits. Delve into link-state routing, reverse path forwarding techniques, and controlled flooding in networks. For additional questions or extra credit inquiries, don't hesitate to reach out at ramya@cs.ucsb.edu.

wylie-rice
Télécharger la présentation

Network Layer

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. Network Layer CS176A Ramya Raghavendra

  2. Routing table [Q1] Destination Address Range Link Interface 10000000 00000000 00000000 00000000 Through 0 10000000 11111111 11111111 11111111 1000001000000000 00000000 00000000 Through 1 10000010 00000000 11111111 11111111 10000010 00000001 00000000 00000000 Through 2 10000010 11111111 11111111 11111111 Otherwise 3

  3. Subnetting [Q2] A F D E B C

  4. Subnetting 214 97 254 /23 11010110 01100001 11111110 00000000 9 N bits – 2n addresses : 8 bits – 256 etc Each router: subnet (A,B or C) + 2 of (D, E, F) • Longest Prefix matching (Examples) • 11010110 01100001 11111111 : A • 11010110 01100001 11111110 0000000 : D

  5. NAT Translation Table [Q3]

  6. Dijkstra’s Algorithm Have some fun: http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Dijkstra.shtml

  7. Link State Routing [Q6] u 5 6

  8. Reverse Path Forwarding [Q7] • Controlled flooding • Router receives a broadcast packet • Checks if the packet came on the “shortest unicast link” to the source • Path used to send a unicast packet to source • If so, forwards it on all other links • Else discards it

  9. Illustration of RPF

  10. Questions on Extra Credit?- Is it easy? YesEmail me!ramya@cs.ucsb.edu

More Related