Essay: SECURE INTELLIGENT HYBRID ROUTING PROTOCOL

It is a combination of OSPF and EIGRP routing protocol including security of the network.
The elements considered in this secure hybrid algorithm for routing are
Initialization
Information from neighbor
Link state protocol
Link state database
Shortest path calculation
Neighbor Table
Neighbor Discovery
Recovery Mechanism
Topology Table
Reliable Transport Protocol
Feasible Distance calculation
Feasible condition
Feasible successor
Routing Table Calculation
Auto summarization
Authentication
Data integrity
ALGORITHM FOR SECURE HYBRID ROUTING PROTOCOL
Secure intelligent hybrid routing protocol depends upon the both Open shortest path first algorithm and Enhanced interior gateway routing protocol that includes secure authentication mechanism. This protocol is designed to obtain the best optimal route at higher convergence with minimum cost. The proposed protocol uses the dynamic intelligent link state routing algorithm that uses the shortest path algorithm and the distance vector algorithm.
DYNAMIC INTELLIGENT LINK STATE ROUTING ALGORITHM
When a router is provided, first it initialize secure routing protocol data structures and then except for denotations from lower-layer protocol that the ports are functional
It initialize number of the routers R_(1,),’,R_n and the number of hosts H_(1,),’,H_n in the networks and it includes Area Border Routers which is represented as area 1,.., area n and then the node topology is initialized.
Next, it gathers the data from the neighbor hops and the entire information is collected and stored in the back bone routers i.e (‘BR’_n), which is used to forward information from one area to another area through the back bone router. It also collects router information from the neighbor.
The router first sends the hello packet to the nearby routers or neighbor routers inside the area border router and then checks the for the time duration is received by the neighbor and based upon this hello packets path, it forms the Link State Protocol ( LSP)
If the router doesn’t receive hello packet then it is considered as the ineffective and death and gives an alarm to the remaining network that is updated in the LSP.
Afterwards, it forms the Link state database where all the information is stored and however all the updates are collected and stored in the database, additionally it includes back bone routers as well as area border router information i.e still the packets reached to its destination
After the Link state data base, it needs to determine the shortest path to reach its desired destination for that it finds the shortest path. The shortest path would be obtained from the shortest path calculation which relies on the least cost path and convergence time.
To find the low cost path, it needs to establish three tables and they are neighbor table, topology table and routing table. These tables have to follow three cases
7(a). Case 1: In neighbor table, every router have to give acknowledgement to the neighbors while sending and receiving the packets and this acknowledgement should be updated from all the routers that includes the Retransmission time out (RTO), if any router fails then it declined as death router and it will be eliminated from the table and therefore to identify the neighbor easily, it uses the neighbor discovery strategy. This method adopts the route recovery schemes to obtain the higher convergence time, later on it moves to topology table.
7(b). Case 2: In topology table, it establishes the successors and viable successors and that maintains the update, queries and reply packets. In case, if routers fails to receive the packets or loss the packet (it is considered as active) and hence the topology will be modified or recalculated still the network becomes passive. After, it forwards the effective path to the routing table
7(c). Case 3: Finally the routing table chooses the efficient and cost effective path that depends on the routing table calculation and the metric considered in this network.
Metric= 256 *
In routing table calculation, it uses the Dijkstra algorithm to determine the successor path and viable successor path
= is a neighbor)
Where:
Represents distance from the source to destination
Denotes path to destination by the known router
Presents links cost of the neighbor k to the router
Represents viable distance for destination j
Therefore each routing table information will be updated only when the changes occurs in the table and moreover entire table will not be forwarded only the changed information will be sent to the neighbor. Thus it achieves route summarization, in order to reduce the memory requirement.
To obtain the security, this algorithm utilizes key management and data integrity in the packet that ensures the secure packet is forwarded to the routers.
Thus the secure and effective path is selected to reach its destination.
text in here…