Ways to Compute Shortest Paths Centralized Collect graph structure in one place Use standard graph algorithm Disseminate routing tables ·Link- state Every node collects complete graph structure Each computes shortest paths from it Each generates own routing table Distance-vector No one has copy of graph Nodes construct their own tables iteratively Each sends information about its table to neighbors 9/28/2006 Lecture 10: Intra-Domain routing 59/28/2006 Lecture 10: Intra-Domain Routing 5 Ways to Compute Shortest Paths • Centralized • Collect graph structure in one place • Use standard graph algorithm • Disseminate routing tables • Link-state • Every node collects complete graph structure • Each computes shortest paths from it • Each generates own routing table • Distance-vector • No one has copy of graph • Nodes construct their own tables iteratively • Each sends information about its table to neighbors