Sie sind auf Seite 1von 17

Dynamic Routing with Security Considerations

Guide:
RAJANNA. M
(Asst. Prof. Dept. Of CSE)

Presented By:
SHREEDHAR. B

Introduction
Security is an Important role in all aspects To improve Security, by using Cryptographic Techniques IP Security and SSL are popular propose a dynamic routing algorithm

Existing System
They used Cryptographic Techniques to improve Security Another alternative way for Securityenhanced routing The intension of Security-enhanced routing

Problem Statement
Routing protocols over Networks Distance Vector Algorithms Link State Algorithms Goal is to propose a Distance Vector based algorithms

Demerits of Existing System


Number of Re-transmission is high Cost is high to implement a cryptographic technique It is applicable for wired Networks

Proposed System
The algorithm is easy to implement and compatible with popular routing protocols RIP-wired networks DSDV-wireless networks Improve Security for data transmission is based on multiple path deliveries

Merits of Proposed System


Cost is low compare to cryptographic technique Its applicable for wired and wireless networks Number of retransmission is less No need to modify the basic routing table No memory space is required

Design

DFD
Source

C hoose D estination

Store

D ata

R andom Path

C heck D atabase

T ransfer M essage

Algorithm
Step 1: Select the source node S Step 2: Choose the destination D if(S==D) No packets transmitted else Choose Random paths if(path=Routing path) This route is already over else Take other route Step 3: Select the distances from source to destination Step 4: Transmits the message Step 5: Update the Routing table

Modules
Topology Construction Random Path Selection Message Transmission Routing Table Maintenance

Node

Check Available

NodeInfo

Already Available

Update Node Info

Expected Outcome
Input: Text/Java File Output: File will be split into number of Packets and transmitted on multiple paths.

Conclusion
This paper has proposed a securityenhanced dynamic routing algorithm. The proposed algorithm is easy to implement and compatible with popular routing protocols, such as RIP and DSDV

Future Enhancement
To enhance the security features instead of using random path selection will make use of new cryptographic algorithms, in order to get efficient packets.

References
I. Gojmerac, T. Ziegler, F. Ricciato, and P. Reichl, Adaptive Multipath Routing for Dynamic Traffic Engineering, Proc. IEEE Global Telecommunications Conf. (GLOBECOM), 2003. C. Hopps, Analysis of an Equal-Cost Multi-Path Algorithm, Request for comments (RFC 2992), Nov. 2000. W. Lou and Y. Fang, A Multipath Routing Approach for Secure Data Delivery, Proc. IEEE Military Comm. Conf. (MilCom), 2001. www.sun.java.com

THANK YOU