[Series of OSPF] Episode 6 Introduce to the algorithm used by OSPF -- Dijkstra's algorithm

Latest reply: Dec 15, 2018 23:27:22 378 2 2 2

In the previous episodes, we talk about how does the OSPF work, such as establish adjacency relationship, exchange LSAs. As we know, OSPF is an abbreviation of Open Shortest Path First, it run Dijkstra algorithm after established full adjacency. In this episode, we will introduce how does the Dijkstra algorithm work. 

Topology shows as below, the number on the link means the cost of the link.
TOPOLOGY
At first, all the devices are in a Set G. Let's start with device A, first of all, exclude A from Set G, now, Set G contains B to F. There is three links on A, link to B, D and E, for each link, the cost is 2, 1 and 3, choose the minimum cost which is 1. and we move to device D, repeat the process of A, until Set G is empty.
Picture this process as below.

140008y6u0kcwwakgcr7k6.png

140008t2p3h5kv76v6k8vk.png

140009mmuwinhd3zdmnwq2.png



when all the device are involved in the shortest path tree, the algorithm stops, and we get the shortest path tree with root A.

shortest path tree

By the end of this episode, we introduce the OSPF from every aspect. In the next episode, we will make a summary of OSPF, introduce something overlooked easily by using OSPF. 


 

  • x
  • convention:

Created Dec 12, 2018 21:00:15 Helpful(0) Helpful(0)

Its hard
  • x
  • convention:

Created Dec 15, 2018 23:27:22 Helpful(0) Helpful(0)

Its hard
  • x
  • convention:

Reply

Reply
You need to log in to reply to the post Login | Register

Notice: To protect the legitimate rights and interests of you, the community, and third parties, do not release content that may bring legal risks to all parties, including but are not limited to the following:
  • Politically sensitive content
  • Content concerning pornography, gambling, and drug abuse
  • Content that may disclose or infringe upon others ' commercial secrets, intellectual properties, including trade marks, copyrights, and patents, and personal privacy
Do not share your account and password with others. All operations performed using your account will be regarded as your own actions and all consequences arising therefrom will be borne by you. For details, see " Privacy."
If the attachment button is not available, update the Adobe Flash Player to the latest version!

Login and enjoy all the member benefits

Login
Fast reply Scroll to top