01:198:352 Lecture Notes - Lecture 10: Parity Bit, Checksum, Routing Table
10 Dec 2017
School
Department
Course
Professor
Document Summary
Routing: graph finding a path through a graph nodes: routers/hosts edges: links weight: cost ($/time/bandwidth whatever you care about) But lots of traffic/messaging to build it. And only globally optimal as long as the network does not change (is a snapshot) Ask neighbors for their route table, add your cost to get to each neighbor to their best routes, add minimal routes to your table every so often, tell your neighbors your routing table. Cycles (node a has a route to node c through node b - node b stops seeing c - A tells b it has a link to c (but doesn"t tell it the link is through b) ) (aka count to infinity) Add infinity to lost links (everyone who tries to reroute through that node will see infinity - so everyone will eventually know that node is out) Determine summand to make data+summand == 0.
