11 - Background Link-State Routing Algorithms...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Background Link-State Routing Algorithms Distance-Vector Routing Algorithms Take-Home Points Routing Algorithms Finding Paths in the Internet Daniel Zappala Brigham Young University Computer Science Department Routing Algorithms Daniel Zappala 1/18 Background Link-State Routing Algorithms Distance-Vector Routing Algorithms Take-Home Points 1 Background Graph Abstraction Algorithms 2 Link-State Routing Algorithms Dijkstra’s Algorithm Oscillations 3 Distance-Vector Routing Algorithms Bellman-Ford Link Changes 4 Take-Home Points Routing Algorithms Daniel Zappala 2/18 Background Link-State Routing Algorithms Distance-Vector Routing Algorithms Take-Home Points Question of the Day How does the Internet determine which path to use from the source to the destination? Challenges need to handle hundreds of thousands of routes need to handle changes anywhere in the network stability is crucial Routing Algorithms Daniel Zappala 3/18 Background Link-State Routing Algorithms Distance-Vector Routing Algorithms Take-Home Points Packet Forwarding versus Routing Routing Algorithms Daniel Zappala 4/18 Background Link-State Routing Algorithms Distance-Vector Routing Algorithms Take-Home Points Graph Abstraction graph G = ( V , E ) nodes/vertices V = u , v , w , x , y , z links/edges E = ( u , v ) , ( u , x ) , ( v , x ) , ( v , w ) , ( x , w ) , ( x , y ) , ( w , y ) , ( w , z ) , ( y , z ) useful for virtual networks as well, e.g. to model a peer-to-peer network of TCP connections Routing Algorithms Daniel Zappala 5/18 Background Link-State Routing Algorithms Distance-Vector Routing Algorithms Take-Home Points Edge Weights or Costs edges can have weights/costs c ( w , z...
View Full Document

This note was uploaded on 10/18/2011 for the course CS 460 taught by Professor Staff during the Spring '05 term at BYU.

Page1 / 18

11 - Background Link-State Routing Algorithms...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online