# 11 - Background Link-State Routing Algorithms...

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

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

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

View Full Document
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

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

View Full Document
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

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

View Full Document
Background Link-State Routing Algorithms Distance-Vector Routing Algorithms Take-Home Points Edge Weights or Costs edges can have weights/costs c ( w , z ) = 5 costs may be all 1 cost of a path is the sum of the cost of all edges in the path routing algorithm finds the least-cost path Routing Algorithms Daniel Zappala 6/18
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern