2. Introduction
• Link State is one of the two main classes of
routing protocol
• Link State Algorithm is characterized
informally as each router “Telling the world
about its neighbor.”
• It’s a non-centralized way to discover the
path. Each node stores distance or costs of the
network by own. There is no centralized
storing mechanism exists.
3. Link State Algorithm
• First Rule, each router should know distance
or cost between its neighbor.
• Source must be a single node or router of the
network.
• Whole Process require steps equal to the
number of routers or nodes exist in the
network.
4. First Step
• Source Node will be stored at U’.
• Distances or costs of every neighbor of source
will be stored as the least distance for this
step.
• For other nodes distance will be “~” or
Infinity.
5. Next Steps
• The node with least distance from source at
the previous step will be stored in U’ array.
• Distances of current U’ node’s neighbors from
source through U’ will be discovered.
• If new distances are less than previous, they
will be updated as the latest least cost paths.
• For other values will be remain same as
before
6. Conclusion
• Steps will be continued until costs through all
nodes are discovered and compared.
• Final result will be stored as the least cost
paths.
