Convert dijkstra's algorithm in parallel so that time to find the minimum distance in link state routing reduces. It is done by exploiting multiple core architecture. I found one solution that if we give each thread some amount of nodes to calculate the min distance and then whenever some thread finds min distance then it will update it globally if it is less than the global minimum.