Scribd
Upload
6 views5 pages

Secure Dynamic Routing Algorithm

This document proposes a distance-vector-based algorithm for dynamic routing to improve security in data transmission over networks. It describes using existing distance information exchanged between neighboring nodes to determine routing paths. Typically in distance-vector routing, each node maintains a routing table with entries for destinations, estimated costs to reach each destination, and the next hop node on the lowest cost path.

Uploaded by

Vianney Tarriela Corners
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views5 pages

Secure Dynamic Routing Algorithm

This document proposes a distance-vector-based algorithm for dynamic routing to improve security in data transmission over networks. It describes using existing distance information exchanged between neighboring nodes to determine routing paths. Typically in distance-vector routing, each node maintains a routing table with entries for destinations, estimated costs to reach each destination, and the next hop node on the lowest cost path.

Uploaded by

Vianney Tarriela Corners
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

DYNAMIC ROUTING WITH

SECURITY CONSIDERATIONS

Background
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.

Proposed solution

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 it 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 ,
and the next node along the minimal-cost path
to the destination node, respectively

You might also like