8/8/2019 palli

http://slidepdf.com/reader/full/palli 1/3

Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptographyalgorithms and system infrastructures, we aim at the proposing of a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, suchas routing information protocol in wired networks and destination-sequenced distance vector protocol in wireless networks, without introducing extra control me

ssages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.

Dynamic Routing with Security Considerations

Modules:1. Network Module2. Dynamic Routing3. Randomization Process4. Routing Table Maintenance

5. Load on Throughput

Module Description:

1. Network Module

Client-server computing or networking is a distributed application architecturethat partitions tasks or workloads between service providers (servers) and service requesters, called clients. Often clients and servers operate over a computernetwork on separate hardware. A server machine is a high-performance host thatis running one or more server programs which share its resources with clients. Aclient also shares any of its resources; Clients therefore initiate communication sessions with servers which await (listen to) incoming requests.

2. Dynamic RoutingTo propose a distance-vector based algorithm for dynamic routing to improve thesecurity of data transmission. 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 maintains a routing table in which eachentry is associated with a tuple, and Next hop denote some unique destination node, an estimated minimal cost to send a packet to t, and the next node along the minimal-cost path to the destination node, respectively.

3. Randomization ProcessThe delivery of a packet with the destination at a node. In order to minimize the probability that packets are eavesdropped over a specific link, a randomization process for packet deliveries, in this process, the previous next-hop for thesource node s is identified in the first step of the process. Then, the processrandomly picks up a neighboring node as the next hop for the current packet transmission. The exclusion for the next hop selection avoids transmitting two consecutive packets in the same link, and the randomized pickup prevents attackers from easily predicting routing paths for the coming transmitted packets.

4. Routing Table MaintenanceIn the network be given a routing table and a link table. We assume that the link table of each node is constructed by an existing link discovery protocol, such

as the Hello protocol in. On the other hand, the construction and maintenance of routing tables are revised based on the well-known Bellman-Ford algorithm.

8/8/2019 palli

http://slidepdf.com/reader/full/palli 2/3

5. Load on Throughput

Investigate the effect of traffic load on throughput for our proposed DDRA; thetraffic is also generated based on variable-bit-rate applications such as file transfers over Transmission Control Protocol (TCP). The average packet size is 1,

000 bytes, and source-destination pairs are chosen randomly with uniform probabilities.

Dynamic Routing with Security ConsiderationsDynamic Routing with Security Considerations

Abstract:

Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography

algorithms and system infrastructures, An analytic study on the proposed algorithm is presented, and experiments 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.

Algorithm Description:

A distance-vector-based algorithm for dynamic routing to improve the security ofdata transmission. 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 the next node along the minimal-cost path to the destination node, respectively.

Existing System:

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 systemsand platforms. Although IPSec and SSL do greatly improve the security level fordata transmission, they unavoidably introduce substantial overheads, especiallyon gateway/host performance and effective network bandwidth. For example, the data transmission overhead is 5 cycles/byte over an IntelPentium 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.

Proposed System:

We will propose a dynamic routing algorithm that could randomize delivery pathsfor data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired netwo

8/8/2019 palli

http://slidepdf.com/reader/full/palli 3/3

rks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages.

Hardware Requirements 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.

Software Requirements

Operating system :- Windows XP Professi

Reference: http://www.seminarprojects.com/Thread-dynamic-routing-with-security-considerations--11744#ixzz0smxrMMm3

This paper delivers some basic information about the security of Web forms fromWeb bots (robots). Possible threats are described and the article gives a list of some methods which can be used to protect Web forms. The emphasis is on the CAPTCHA (completely automated public turing test to tell computers and humans Apart) method that is most often used method. At the end of paper you can find one implementation of security methods using PHP and MySQL technologies.