Posts: 610
Threads: 262
Joined: Jun 2010
Dynamic Routing with Security Considerations
Modules:
1. Network Module
2. Dynamic Routing
3. Randomization Process
4. Routing Table Maintenance
5. Load on Throughput
Module Description:
1. Network Module
Client-server computing or networking is a distributed application architecture that partitions tasks or workloads between service providers (servers) and service requesters, called clients. Often clients and servers operate over a computer network on separate hardware. A server machine is a high-performance host that is running one or more server programs which share its resources with clients. A client also shares any of its resources; Clients therefore initiate communication sessions with servers which await (listen to) incoming requests.
2. Dynamic Routing
To propose a distance-vector based algorithm for dynamic routing to improve the security 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 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.
3. Randomization Process
The 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 the source node s is identified in the first step of the process. Then, the process randomly 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 Maintenance
In the network be given a routing table and a page link table. We assume that the page link table of each node is constructed by an existing page 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.
5. Load on Throughput
Investigate the effect of traffic load on throughput for our proposed DDRA; the traffic 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.
Posts: 1
Threads: 0
Joined: Dec 2010
what is the previos paper for "Dynamic routing with security considerations"
Posts: 3,561
Threads: 923
Joined: Sep 2010
if you want to know some more information on Dynamic routing with security considerations , please go through the following thread.
http://studentbank.in/report-dynamic-rou...3#pid31233
Posts: 5,362
Threads: 2,998
Joined: Feb 2011
PRESENTED BY:
E.PRASAD BABU
G.SRIRAMULU
S.SRAVANI
P.KARTIKEY
[attachment=10771]
INTRODUCTION
In the past decades, various security-enhanced measures have been proposed to improve the security of data transmission over public networks.
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.
The data 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
Another alternative for security-enhanced data transmissions to dynamically route packets between each source and its destination so that the chance for system break-in, due to successful interception of consecutive packets for a session, is slim.
The intention of security-enhanced routing is different from the adopting of multiple paths between a source and a destination to increase the throughput of data transmission.
The set of multiple paths between each source and its destination is determined in an online fashion, and extra control message exchanging is needed.
They proposed a traffic dispersion scheme to reduce the probability of eavesdropped information along the used paths provided that the set of data delivery paths is discovered in advance.
Although excellent research results have been proposed for security-enhanced dynamic routing, many of them rely on the discovery of multiple paths either in an online or offline fashion.
On the other hand, the discovery of paths in an offline fashion might not be suitable to networks with a dynamic changing configuration.
we will propose a dynamic routing algorithm to provide security enhanced
OBJECTIVE
Data delivery without introducing any extra control messages.
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.
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 Description
A distance-vector-based algorithm for dynamic routing to improve the security 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 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.
Routing Table
With the objective of this work in the randomization of routing paths, the routing table is extended to accommodate our security-enhanced dynamic routing algorithm.
It maintains set of node candidates for the next hop.
And a set of tuples, records the history for packet deliveries through the node Ni to the destination node t.
Extended routing table
EXISTING SYSTEM
Existing work on security-enhanced data transmission includes the designs of cryptography algorithms and system infrastructures and security-enhanced routing methods.
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.
The data 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.
PROPOSED SYSTEM
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.
CONCLUSION
This paper has proposed a security-enhanced dynamic routing algorithm based on distributed routing information widely supported in existing networks.
The proposed algorithm is easy to implement and compatible with popular routing protocols, such as RIP and DSDV, over existing infrastructures.
Posts: 1
Threads: 0
Joined: Dec 2011
i just want to know the test cases,future scope and cost estimation for dynamic routing with security considerations in which distance vector routing algorithm is used.the project contains the modules like server,centralized server,client.plzzzzzz
Posts: 6,566
Threads: 1,107
Joined: Jul 2011
to get information about the topic"Dynamic Routing with Security Considerations" refer the page link bellow
http://studentbank.in/report-dynamic-rou...6#pid59666
Posts: 6,566
Threads: 1,107
Joined: Jul 2011
