network layer n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Network Layer PowerPoint Presentation
Download Presentation
Network Layer

Loading in 2 Seconds...

play fullscreen
1 / 10

Network Layer - PowerPoint PPT Presentation


  • 137 Views
  • Uploaded on

Network Layer. CS176A Ramya Raghavendra. Routing table [Q1]. Destination Address Range Link Interface 10000000 00000000 00000000 00000000 Through 0 10000000 11111111 11111111 11111111 10000010 00000000 00000000 00000000 Through 1 10000010 00000000 11111111 11111111

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Network Layer' - leonard


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
network layer

Network Layer

CS176A

Ramya Raghavendra

routing table q1
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

subnetting
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
dijkstra s algorithm
Dijkstra’s Algorithm

Have some fun:

http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Dijkstra.shtml

reverse path forwarding q7
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