Lecture 15: Routing Algorithms

There are 17 different paths between u and z. Which is the least-cost?

Routing is one of the big components of the Network Layer. The last lecture talked about how individual packets are addressed and how they are forwarded at each router based on the forwarding table. The routing algorithms described today are the basis for filling the forwarding table.

There are two main types of routing algorithms — Distance-Vector and Link-State. Distance Vector algorithms are decentralized and don't require the routing nodes to have global information about the network. Link-state algorithms require global knowledge, but are very stable.

Lesson Objectives

By the end of this lesson, the student will be able to: