CIS 3210 Lecture Notes - Lecture 29: Network Layer, Forwarding Plane

• School: University of Guelph
• Department: Computing and Information Science
• Course: CIS 3210
• Professor: Xiaodong Lin

Document Summary

Forwarding: move packets from router"s input to appropriate router output. Routing: determine route taken by packets from source to destination. Approach that we will learn about: per-router control (traditional approach) Routing protocol goal: determine good paths (routes), from sending hosts to receiving host, through network of routers. Cost would be the inverse of the bandwidth, and we want to nd the least cost path from source to destination. Global: link state algorithms - all routers broadcast their connections. Able to use the shortest path algorithm. Each router only knows the connections to its neighbours. Alg complexity: n nodes, each iteration needs to check all nodes, w, not in n. **each router must know the entire network topology** Look at all the possible values from x through all of its neighbours to the destination. The neighbours can look at their neighbours in a recursive manor to nd the destination.