In previous section, we already learn about DVRP.
Today we will learn about LSRP.
What is LSRP?
LSRP is a routing protocol that contain a full topology of network.
LSRP is using Djikstra algorithm or commonly called by SPF (Shortest Path First) Algorithm.
Today we will learn about LSRP.
What is LSRP?
LSRP is a routing protocol that contain a full topology of network.
LSRP is using Djikstra algorithm or commonly called by SPF (Shortest Path First) Algorithm.
Now we will learn how the process of Link State:
1. Every router will learn about it’s directly connected network
2. Every router will send “hello packet” to neighbor / directly connected network.
3. Every router make LSP (Link State Packet) that contain information (cost) every directly connected network.
4. Every roter send LSP to all neighbor/flooding , after that being saved in a database.
5. Every router use it’s database to create topology and count the best path to every destination network.
1. Every router will learn about it’s directly connected network
2. Every router will send “hello packet” to neighbor / directly connected network.
3. Every router make LSP (Link State Packet) that contain information (cost) every directly connected network.
4. Every roter send LSP to all neighbor/flooding , after that being saved in a database.
5. Every router use it’s database to create topology and count the best path to every destination network.
The advantages using LSRP is:
- Know all topology
- Fast Convergence
- LSP send if there are any changes in topology
- Hierarchial Design (multi area).
- Know all topology
- Fast Convergence
- LSP send if there are any changes in topology
- Hierarchial Design (multi area).
the example of LSRP is OSPF.
here is the example for OSPF
0 comments:
Post a Comment