jyotsna final pp t
TRANSCRIPT
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 1/22
TITILE
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 2/22
Abstract:
• Proposing distributed path computation with intermediatevariables (DIV) algorithm that enables distributed, light-
weight, loop-free path computation.
• it can run on top of any routing algorithm to provide loop-freedom.
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 3/22
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 4/22
Proposed System:
• 1) Separation of Routing and Loop prevention:DIV separatesrouting algorithms from the task of transient loop prevention.
• to increase the robustness of the network able to reroute packetsimmediately (i.e., without the need for any route update) withoutcausing a loop after a link or node failure.
• 2) Reduced Overhead: When applied to shortest path computations,
DIV triggers synchronous updates less frequently as well as reducesthe propagation radius of synchronous updates.
• 3) Maintaining a path: A node can potentially switch to a new
successor more quickly.
4)Convergence Time: When a node receives multiple overlapping
cost updates from its neighbor, DIV allows the node to process andrespond to the updates in an arbitrary manner, enabling anadditional dimension for optimization.
• 5) Robustness: DIV can tolerate arbitrary packet reordering andlosses without sacrificing correctness
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 5/22
Introduction • Distributed routing algorithms may give rise to transient
loops during path recomputation, which can pose significant stability problems in high-speed networks.
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 6/22
ALGORITHM
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 7/22
USE-CASE DIAGRAM
sender
Backup Configuration
fileprocessing
Acyclic Routing Configuration
destination
Client Side Information
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 8/22
SEQUENCE DIAGRAM
Destinationclient File processing Router Path
Configuration
file Transmitting
sending file to router
Router failure
Information to client
Transferring file using back up
Configuration
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 9/22
CLASS DIAGRAM
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 10/22
Modules:
• 1) Distributed Time-to-Live Module
• 2) Loop Free Routing Module
• 3) Robust Routing Module
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 11/22
Distributed Time-to-Live Module
• Time-to-Live (TTL) field in packet headers or aTTL set to a large value. In the presence of arouting loop.
• a packet caught in the loop comes back to thesame nodes repeatedly.
• increasing the traffic load many folds on the
affected links and nodes.• Avoiding transient routing loops for path
computation
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 12/22
Loop Free Routing Module• each node depends on the computation results of its neighbors,
which can introduce cyclic dependencies that increase the numberof steps needed to reach a final.
• Reduced overhead
• Convergence Time
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 13/22
Robust Routing Module• maximize the number of next-hops available at all nodes for each
destination.
• The availability of multiple next-hops ensures that the failure of any one link or neighbor does not impede a node’s ability to continueforwarding traffic to a destination.
• the node can continue forwarding packets on the remaining ones without waiting for new paths to be computed.
• the routing is robust to local failures
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 14/22
SCREENS
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 15/22
SCREENS
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 16/22
SCREENS
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 17/22
SCREENS
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 18/22
CONCLUSION• Distance-vector algorithms have advantages over link-state
algorithms, lower resource requirements and often greater stability by keeping the impact of changes local.
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 19/22
FUTURE WORK• Future research on improving performance of convergence rate of
the preferred techniques.
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 20/22
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 21/22
Hardware Requirements:
• System : Pentium IV 2.4 GHz.
• Hard Disk : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 512 Mb.
7/28/2019 Jyotsna Final Pp t
http://slidepdf.com/reader/full/jyotsna-final-pp-t 22/22
Software Requirements:
• Operating system : - Windows XP.
• Coding Language : -JAVA, Swing, RMI,J2ME(Wireless Toolkit)
• Tool Used : - Eclipse 3.3