Link State Routing in computer networks || Link state routing algorithm || Computer Networks

A link state routing – one of the intra domain routing algorithm has been studied with example.
Link-state routing protocols are one of the two main classes of routing protocols used in packet switching networks for computer communications, the other being distance-vector routing protocols.
The link-state protocol is performed by every switching node in the network. The basic concept of link-state routing is that every node constructs a map of the connectivity to the network, in the form of a graph, showing which nodes are connected to which other nodes. Each node then independently calculates the next best logical path from it to every possible destination in the network. Each collection of best paths will then form each node's routing table.

Go to the following link for Distance Vector Routing

🌎Online utility playlist:

🖥️Computer Networks playlist:

🔔SUBSCRIBE to channel for more videos:

[raz]

I am just studying networking as a hobby and couldn't find a better explanation than this. Kudos

[ashu]

Thank you Bro!! I have an exam tmrw it helped me a lot☺

[sarmadkhan]

Satisfied, easy to understand, thankyou brother.

[larsb]

my Left ear learned very good about networks now

[madangowri]

Good explanation sir but please keep the video stable because it hurting my eye sight

[divyadubey]

Helped me for exam preparation. Please use PPT to avoid anime. disturb