Dynamic Routing With Security Considerations

Scope
In this project we deal fully about the security which has become one of the major issues for data communication over wired and wireless networks. The objective of this work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets.

Existing System
Every node in the network is given a routing table and a link table using Hello protocol. Construction and maintenance of routing tables are revised based on the well known Bellman-Ford algorithm.

Disadvantages
The discovery of paths in an offline fashion might not be suitable to networks with a dynamic changing configuration which has been in existing system.

Proposed System
The proposed algorithm implements popular routing protocols, such as
Routing Information Protocol(RIP) for wired networks. Destination-sequence Distance vector(DSDV) for wireless network.

Those based on RIP, each node maintains a routing table If the proposed algorithm is implements over RIP with equal cost links, then the resulted path set would be same as that generated by an equalcost multipath protocol based on RIP.

Advantages
Our security enhanced dynamic routing could be used with cryptography- based system design to further improve the security of data transmission over networks.

System Requirements
Software Requirement :
Operating System Service Pack Front end Back end Tools Used : Windows XP or Higher : 2+ : Java, Swings : Ms-Access : Jframe Builder

Hardware Requirement:
Processor Ram Hard Disk Monitor Floppy drive Keyboard Mouse : Pentium 4 or Higher : 512 Mb or more : 20 Gb space : VGA Color(256) : 1.44Mb : Standard 102 keys : 3 buttons

Modules
Constructing desired LAN structure Calculation of next hop Calculation of hop count Updating of cost and next hop in routing table. History of Path through which packet delivered

Constructing desired LAN structure

Depending upon the number of nodes and the links between them a LAN structure was designed for which possible path was calculated using inter domain packet filtering. the sample LAN structure which is to be taken in account for the process is shown below.

Calculation of next hop

Dynamically we are finding the valuable route to the destination node using next hop details present in the routing table.

Calculation of hop count

Hop count is the number of nodes present in between the source and the destination.

Updating of cost and next hop in routing table

Calculated values i.e., next hop and hop count value is stored in dynamic routing table for the future calculation.

History of Path through which packet delivered

In this module, we are calculating the total secure path to transfer the data. Then we are going to transfer the message by using the calculated total secure path. Thus the data is transferred securely to the destination successfully.

Conclusion
The proposed algorithm is easy to implement and compatible with popular routing protocols, such as RIP and DSDV, over existing infrastructures. An analytic study was developed for the proposed algorithm and was verified against the experimental results. Our security enhanced dynamic routing could be used with cryptography-based system designs to further improve the security of data transmission over networks.

Example

Refresh Click to update the screen and its data. The date and time indicate when the screen was last updated. Clear Routes Click this button to clear the dynamic routing entries, such as RIP and OSPF, from the display. Clicking this button does not affect the display of static routing entries. Valid Routes The total number of current valid routes that the VPN Concentrator knows about. This number includes all valid routes, and it may be greater than the number of rows in the routing table, which shows only the best routes with duplicates removed. Address The packet destination IP address to which this route applies. This address is combined with the subnet mask to determine the destination route. 0.0.0.0 indicates the default gateway. Mask The subnet mask for the destination IP address in the Address field. 0.0.0.0 indicates the default gateway. Next Hop For remote routes, the IP address of the next system in the path to the destination. 0.0.0.0 indicates a local route. There is no next hop. Interface The VPN Concentrator network interface through which traffic moves on this route: 1 = Ethernet 1 (Private) interface. 2 = Ethernet 2 (Public) interface. 3 = Ethernet 3 (External) interface.

 Protocol The protocol or source of this routing table entry: RIP = Learned via Routing Information Protocol. OSPF = Learned via Open Shortest Path First protocol. Static = Configured static route. Local = Local VPN Concentrator interface address. ICMP = Learned from an ICMP (Internet Control Message Protocol) redirect message. Default = The default gateway. Age The number of seconds since this route was last updated or otherwise validated. The age is relative to the screen display time, for example: 25 means the route was last validated 25 seconds before the screen was displayed. 0 indicates a static, local, or default route. Metric The metric, or cost, of this route. One is the lowest value; sixteen is the highest value.