..::You can change the world with the knowledge::..

Link-state algorithm is also known as Dijkstra's algorithm or algorithms shortest path first (SPF). These algorithms improve the information database of topology information. Distance vector algorithm has nonspecific information about distance network and the router does not know the distance. While the link-state algorithms to improve knowledge of the distance the router and how they inter-connections.
Features are owned by the link-state routing is:

- Link-state advertisement (LSA) - is a small packet of routing information that is sent between routers
- Topological database - is a collection of information from the LSA, LSA
- SPF algorithm - is the result of calculations on the database as a result of the SPF tree
- Routing table - a list of routes and interfaces

The process of discovery of link-state routing
When the router LSA exchanges, starting with a network that connects directly about the information they have. Each router build a topology database that contains exchange of information LSA.
SPF algorithm to calculate the network that can be achieved. Routers build logical topology as a tree (tree), with the router as root. This topology contains all the possible routes to reach the network in the internetwork link-state protocol. The router then uses SPF to shorten the route. List of the best routes and a network interface to the destination in the routing table. Link-state topology database which also fix the other elements of the topology and status in detail.

The first router to learn the topology change of link-state routers pass information so that all can use it for the update process. Figure is the routing information sent to all routers in the internetwork. To achieve the state of convergence, each router studying neighboring routers. Including the names of neighboring routers, interface status and the cost of a link to its neighbors. Router LSA who sign up with a package this information from the new neighbors, the link cost changes and the links that are no longer valid. LSA packet is then sent out sehinggan all other routers to receive it.

At the router receives a LSA, he then update the routing table with the most current information. Data calculation results are used to create maps internetwork and lagoritma SPF is used to calculate the shortest path to other networks. Each time the LSA packet causes changes to the database link-state, then an SPF of doing re-calculation for the best path and update the routing table.
There are some serious points associated with the link-state protocol:
- Processor overhead
- Memory Requirements
- Consumption of bandwidth
Routers that use link-state protocols require more memory and process more data than routers that use distance vector protocols. Router link-state requires enough memory to handle all the information from the database, the tree topology and routing table. Figure shows the initial link-state flooding packets that consume bandwidth. In the initial discovery process, all the routers that use link-state routing protocols send LSA packets to all neighboring routers. This event causes a reduction in the bandwidth available for routing traffic to carry user data. After this initial flooding, link-state routing protocols generally require a minimum bandwidth to send LSA packets that cause a topology change.