uni
Each router advertises its neighbor topology (for example link states) through Link State Packets (LSP).
For each link it is specified the address of the neighboring node and the metric associated to traversing the link.
Every router sends its own LSP to neighbors and propagates LSPs generated by other routers.
This way each router receives all LSPs generated in the network and:
- it stores LSPs in an LSP database
- determines the route topology from the LSP database
- computes the minimum cost path to each destination by means of the shortest path first algorithm
- builds the routing table based on the previous result
Algoritmo Link State
Questo algoritmo è molto stabile, ed ha un ordine di convergenza di con numero di link e numero di nodi.
Die router mussen die topologie alleine computen
The routers need to compute the topology independently one from another, so there’s no bottleneck.
It has a short reaction time to topology changes.