Posts: 52
Threads: 24
Joined: Oct 2009
Reputation:
0
Dynamic 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 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.
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 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, 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.
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 Professional
Front End : - Java Technology.
Posts: 48
Threads: 22
Joined: Apr 2009
Reputation:
0
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: 52
Threads: 22
Joined: Jul 2009
Reputation:
0
Dynamic 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, 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. Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs Abstract An un weighted graph has density _ and growth rate k if the number of nodes in every ball with radius r is bounded by _rk. The communication graphs of wireless networks and peer-to-peer networks often have constant bounded density and small growth rate. In this paper, we study the trade-off between two quality measures for routing in growth-restricted graphs. The two measures we consider are the stretch factor, which measures the lengths of the routing paths, and the load-balancing ratio, which measures the evenness of the traffic distribution. We show that if the routing algorithm is required to use paths with stretch factor c, then its load-balancing ratio is bounded by O _1=k n=c 1_1=k , and the bound is tight in the worst case. We show the application and extension of the trade-off to the wireless network routing and VLSI layout design.
Posts: 57
Threads: 28
Joined: Sep 2009
Reputation:
0
[attachment=4707]
Dynamic Routing with Security Considerations
Chin-Fu Kuo, Member, IEE, Ai-Chun Pang, Member, IEE, and Sheng-Kun Chan
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, 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. 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.
Posts: 59
Threads: 17
Joined: Sep 2009
Reputation:
0
[attachment=5410]
Dynamic Routing with Security Considerations
Chin-Fu Kuo, Member, IEE, Ai-Chun Pang, Member, IEE, and Sheng-Kun Chan
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, 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. 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.
Posts: 49
Threads: 15
Joined: Sep 2009
Reputation:
0
Posts: 63
Threads: 30
Joined: Oct 2009
Reputation:
0
[attachment=5685]
Dynamic Routing with Security Considerations
BY:
G.VENKATA SRI KRISHNA 06S11A1256
G.SURENDER YADAV 06S11A1250
CH.SNEHA 05S11A1250
Introduction:
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.
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.
Posts: 58
Threads: 26
Joined: Sep 2009
Reputation:
0
[attachment=7033]
Dynamic Routing Protocols I RIP
Routing
Recall: There are two parts to routing IP packets:
1. How to pass a packet from an input interface to the output interface of a router (packet forwarding) ?
2. How to find and setup a route ?
We already discussed the packet forwarding part
There are two approaches for calculating the routing tables:
Static Routing
Dynamic Routing: Routes are calculated by a routing protocol
Posts: 49
Threads: 20
Joined: Jul 2009
Reputation:
0
Posts: 69
Threads: 27
Joined: Jul 2009
Reputation:
0
To get more information about the topic "DYNAMIC ROUTING WITH SECURITY CONSIDERATIONS " please refer the page link below
http://seminarsprojects.net/Thread-dynam...ull-report
http://seminarsprojects.net/Thread-dynam...ons--11716
|
