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#
'''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#