project pptnew
TRANSCRIPT
-
8/3/2019 Project PptNEW
1/22
CAPTURING ROUTERCONGESTION AND DELAY
Internal guide: Presented by:
Mrs.G.KALYANI
Project CoordinatorInformation technology
B.DILEEP KUMAR(06R01A1213)
B .RAKESH(07R01A1214)D.DEVI SINGH(07R01A1224)
-
8/3/2019 Project PptNEW
2/22
Introduction
This system is helpful in transmitting data from
source to destination with high security using
cryptography algorithms and security enhanced
routing methods that restricts loss of
information
-
8/3/2019 Project PptNEW
3/22
ABSTRACT
y Security has become one of the major issues for datacommunication over wired and wireless networks.
Different from the past work on the designs ofcryptography algorithms and system infrastructures,we will propose a security enhanced dynamic routingalgorithm that could randomize delivery paths for data
transmission.
-
8/3/2019 Project PptNEW
4/22
WHAT IS DYNAMIC ROUTING?y Dynamic routing enables network devices to obtain
topology information, routes and IP addresses fromother routers automatically.
WHAT IS THE PURPOSE OF DYNAMIC ROUTING ?
y
It allowed devices to dynamically learn networkinformation and reroute traffic around failed network.
y Interior gateway protocols such as RIP and OSPFautomatically discovered the addresses and states of
different devices on the network and determined the
-
8/3/2019 Project PptNEW
5/22
WHAT IS SECURITY?y Security is the protection of a person, property or
organization from an attack. The types of protection
include prevention ,response and pre-emptive attacks.
HOW SECURITY PLAY A KEY ROLE IN NOW A DAYS?
Security solutions such as firewalls and VPNS, protectnetwork resources against attacks, intrusions ,andmalicious activity.
-
8/3/2019 Project PptNEW
6/22
ALGORITHMS FOR DYNAMIC ROUTING
y
It is based on distributed routing information widelysupported in existing networks. In general routingprotocols over network could be classified roughly intwo parts .
y 1.distance vector algorithms
y Example: RIP and DSDV
y 2.link state algorithm
y Example :OSPF
-
8/3/2019 Project PptNEW
7/22
ALGORITHMS FOR PROVIDING
SECURITY
y Security enhanced dynamic routing algorithm
y It is a distance vector based algorithm for dynamicrouting to improve the security of data transmission.
-
8/3/2019 Project PptNEW
8/22
Existing System
y Existing work on security-enhanced data transmissionincludes the designs of cryptography algorithms andsystem infrastructures and Security enhanced routingmethods.
y IPSec and SSL do greatly improve the security level fordata transmission, they unavoidably introducesubstantial overheads, especially on gateway/hostperformance and effective network
-
8/3/2019 Project PptNEW
9/22
Limitations of Existing System
IP sec VPNS
do not support a standard method ofexchanging route information over a encryptedtunnels.
Extra control messages needed.
Data transmission overhead.
-
8/3/2019 Project PptNEW
10/22
Proposed System
y We will propose a security enhanced dynamic routingalgorithm to provide security enhanced data delivery
without introducing any extra contol messages.y It is based on DDRA.It consists of two parts
yA randomisation process for packet delivery
y Maintenance of the extended routing table
-
8/3/2019 Project PptNEW
11/22
AN EXAMPLE OF TH
E ROUTING TABLEFOR THE NODE Ni
-
8/3/2019 Project PptNEW
12/22
Advantages of proposed system
y Random delivery paths for data transmission
y
Easy to implement and Compatible with popularrouting protocols
y No extra control messages
yAdministrator has less work maintaining the
configuration when adding or deleting networks.y Protocols automatically react to the topology changes
y Configuration is less error phone
y More scalable
-
8/3/2019 Project PptNEW
13/22
Modules
y Network Module
y Dynamic Routingy Randomization Process
y Routing Table Maintenance
y
Load onT
hroughput
-
8/3/2019 Project PptNEW
14/22
NETWORKMODULE:Client-server computing or networking is a distributedapplication architecture that partitions tasks orworkloads between service providers (servers) and
service requesters, called clientsDYNAMICROUTING:
To propose a distance-vector based algorithm fordynamic routing to improve the security of data
transmission.RANDOMIZATION PROCESS:
The delivery of a packet with the destination at anode.
-
8/3/2019 Project PptNEW
15/22
ROUTINGTABLEMAINTENANCE:
In the network be given a routing table and a link table
LOADONTHROUGHPUT:
The traffic is too generated based on changeable-bit-rate applications such as file transfer overTransmission
Control Protocol (TCP).
-
8/3/2019 Project PptNEW
16/22
System Requirements
HardwareRequirements
y S
ystem : Pentium IV 2.4
GHz.y Hard Disk : 40 GB.
y Floppy Drive : 1.44 Mb.
y Monitor : 15VGA Colour.
y Mouse : Logitech.y Ram : 256 Mb.
-
8/3/2019 Project PptNEW
17/22
Software Requirements
y Operating system : - Windows XP Professional.y Coding Language : - Java.
y Tool Used : - Eclipse
-
8/3/2019 Project PptNEW
18/22
Data Flow
SOURCE
ROUTER A
ROUTER B
ROUTER C
SUB A1
SUB A2
SUB B1
SUB B2
SUB C1
SUB C2
DESTINATION
-
8/3/2019 Project PptNEW
19/22
USECASE DIAGRAM
-
8/3/2019 Project PptNEW
20/22
Sequence Diagram
Sender Routing
Information
Available
Routers
Dynamic
Routing
Destinatoin
Collect routing information
Select routing paths
Routing dynamically with security
Sending data to destination
Received data
-
8/3/2019 Project PptNEW
21/22
Conclusion
This paper has proposed a security-enhanced dynamic
routing algorithm based on distributed routinginformation widely supported in existing networks
-
8/3/2019 Project PptNEW
22/22
Thank you