Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2011:journals:andrew:chapter6 [2011/03/29 00:21] – bennetta
+++ courses:cs211:winter2011:journals:andrew:chapter6 [2011/04/05 23:24] (current) – bennetta
@@ Line 65: / Line 65: @@
 ===== 6.5-6.8 Final Words =====
 This is a section that I did not understand too particularly well both in the book and in class. The shortest path portion was probably my strongest area but I'm struggling a little bit with this material. Glad I did this journal on Monday so I know to get some extra help on this material before the problem set is due on Friday. Readability: 5/10
+===== 6.9: Shortest Paths and Distance Vector Protocols =====
+   *Shortest Paths algorithm can be applied to routers in a communication network to determine the most efficient path.
+     * Nodes are routers and edges are direct paths between these routers.
+     * Find minimum delay from a source node s to a destination node t.
+     * Cannot use Dijkstra's because it requires global knowledge.
+     * Bellman-Ford give us the best option
+     * Use a "push-based" algorithm rather than the "pull-based" algorithm of the original Bellman-Ford
+     * This pushed based method can be seen on page 298 and an Asynchronous version can be found on page 299\
+     * Problems:
+       * Assumes edge costs will remain constant
+       * Can cause counting to infinity
+     * For this reason path vector protocols are better than distance vector protocols