SOLVED: Question 2: Using Link State Routing (Dijkstra's algorithm) find the least cost Path for the below given structure from Node "b" (IMark). Also construct the forwarding table of "b" once least
Solved Given the 6-node network map showing the least-cost | Chegg.com
BLOCK DIAGRAM OF THE LEAST COST ROUTER | Download Scientific Diagram