Design Analysis of OSPF (Open Shortest Path First) Routing by Calculating Packet Loss Of Network WAN (Wide Area Network)

In companies both large and small, they must always communicate and exchange data to other divisions at a considerable distance. In carrying out the process of data exchange, it is not uncommon for the data to suffer damage and some do not even reach the destination, the incident is known as packet loss. Therefore, a routing protocol is needed to solve the problem. OSPF routing is the right routing to be implemented. Because, OSPF routing uses Dijkstra's algorithm to find the closest distance, OSPF determines the best path based on the lowest cost and OSPF also divides its network into several levels, so the information dissemination on each router becomes that has been done, messages time from PC to PC get a range of values of 0.25%. Based on the analysis table of packet loss, the packet is categorized very well, because the packet sent is not much lost.