EXPERIMENT-12:
OBJECTIVE: Implementing link state
THEORY: Link-State Routing is a dynamic routing protocol used in computer networks
where each router maintains a map of the entire network's topology. In this approach, routers
periodically share information about their directly connected neighbours with all other routers
in the network. Each router uses this link-state information to build a complete map of the
network and then calculates the shortest path to every other router using algorithms like
Dijkstra's algorithm. Link-State protocols, such as OSPF (Open Shortest Path First), provide
more accurate and scalable routing compared to Distance Vector protocols, as they allow
routers to react faster to network changes. The protocol involves the flooding of Link-State
Advertisements (LSAs), which contain the state of a router's links, and ensures that all routers
have an up-to-date view of the network. One key benefit of Link-State Routing is that it
reduces routing loops and provides faster convergence. However, it requires more memory
and processing power compared to simpler protocols.
CODE:
OUTPUT: