Static Routing Protocol

• Static routing is not really a type of routing protocol, but it is a network routing technique because it usually managed by the network administrator for configuration as well as a selection of a network route. 
• Static routing can be used if there is the smallest network for route configuration and there is no need to exchange any change in route in the future.
• It is easy to configure, but it is done manually.
• It used for small organizations because the administrator needs to learn all the routes.
• It doesn’t handle failures outside the networks well because it reconfigured or any update done manually to fix the network problem.
• In static routing administrator constructs the routing table for every router by inserting all the entries of network (destination).
• Static routes have an Administrative Distance (AD) of 1.
• It is very secure because it can’t send any advertisement, like other routing protocols.
• In static routing protocol there is no routing algorithm or update mechanism are required (no need extra CPU and memory).
• If there is any link fails, then static route can’t reroute traffic automatically. It needs to reroute traffic manually.

OSPF Routing Protocols

• OSPF is an open standard routing protocol, it means it is implemented for large scale that are not used by other routing protocols either it is a distance vector(RIP) or hybrid protocol (EIGRP), and it works on a variety of network vendor including Cisco. It uses Dijkstra algorithm, i.e. best for implementing in a hierarchical design. 

• OSPF introduce the concept of areas for managing and controlling the network traffic. It creates a neighbor relationship with adjacent routers in the same area.

• OSPF provides hierarchical network design with multiple different areas and all other areas must be connected to the area 0. 

• OSPF uses a multicast address (224.0.0.5) for routing updates (all OSPF routers), but all designated routers use the different multicast address (224.0.0.6) for routing updates.

• OSPF is a link-state routing protocol which is also known as “shortest path first” protocol.

• It creates three separate tables for understanding the inter-network.

• First table gets all the information about directly connected neighbor. 

• Second table determines the topology of the entire inter-network. 

• Third tables used as routing table.

• OSPF consists of the areas and autonomous systems. 

• It have unlimited hop count.

• On OSPF routing overhead is decreased and convergence is faster. 

• It sends the packets after every 5 seconds. 

• It also supports authentication. 

• It only supports equal cost load balancing. Metric is cost (cost= 10^8/b.w).