2011-05-16

Final review problem 2 -- Chak Li, Weili Liu, & Ngoc Nguyen.

Originally Posted By: chakpli
2. List the contents of a link state packet. Give an example illustrating how Dijkstra's algorithm works. (pg.
4.2 & slide Apr. 6)

An LSP consists of: The identity of the sender, followed by a sequence number, a TTL, and then
followed by a list of neighbors.

Example of Dijkstra's algorithm is provided in the following doc.
https://docs.google.com/document/d/16Nn ... dit?hl=en#
'''Originally Posted By: chakpli''' 2. List the contents of a link state packet. Give an example illustrating how Dijkstra's algorithm works. (pg.<br>4.2 & slide Apr. 6)<br><br>An LSP consists of: The identity of the sender, followed by a sequence number, a TTL, and then<br>followed by a list of neighbors.<br><br>Example of Dijkstra's algorithm is provided in the following doc.<br>https://docs.google.com/document/d/16Nn ... dit?hl=en#
2011-05-21

-- Final review problem 2 -- Chak Li, Weili Liu, & Ngoc Ngu
Originally Posted By: eturkov
pretty good video of the problem solving process here:
http://www.youtube.com/watch?v=psg2-6-CEXg
'''Originally Posted By: eturkov''' pretty good video of the problem solving process here:<br>http://www.youtube.com/watch?v=psg2-6-CEXg
X