Dynamic routing with security consideration Java Project
Dynamic Routing with Security Considerations
Security has become one of the major issues for data communication over wired and . Different from the past work on the designs of algorithms and system , An analytic study on the proposed algorithm is presented, and are conducted to verify the analytic results and to show the capability of the proposed algorithm.
Algorithm / Technique used:
Distance-vector-based algorithm for dynamic routing.
A distance-vector-based algorithm for dynamic routing to improve the security of . We propose to rely on existing distance information exchanged among neighboring nodes (referred to as routers as well in this paper) for the seeking of routing paths. In many distance-vector-based implementations, e.g., those based on RIP, each node Ni maintains a routing table in which each entry is associated with a tuple and Next hop denote some unique destination node, an estimated minimal cost to send a packet to t, and node along the minimal-cost path to the destination node, respectively.
Existing work on security-enhanced data transmission includes the designs of cryptography algorithms and system infrastructures and security-enhanced routing methods. Their common objectives are often to defeat various threats over the Internet, including eavesdropping, spoofing, session hijacking, etc. Among many well-known designs for cryptography based systems, the IP Security (IPSec) and the Secure Socket Layer (SSL) are popularly supported and implemented in many systems and platforms. Although IPSec and SSL do greatly improve the security level for data transmission, they unavoidably introduce substantial overheads, especially on gateway/host performance and effective network bandwidth. For example, thedata transmission overhead is 5 cycles/byte over an Intel
Pentium II with the Linux IP stack alone, and the overhead increases to 58 cycles/byte when Advanced Encryption Standard (AES) is adopted for encryption/decryption for IPSec.
We will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages.
SYSTEM : Pentium IV 2.4 GHz
HARD DISK : 40 GB
FLOPPY DRIVE : 1.44 MB
MONITOR : 15 VGA colour
MOUSE : Logitech.
RAM : 256 MB
KEYBOARD : 110 keys enhanced.
Operating system :- Windows XP Professional
Front End : - Java Technology.