TITILE

Abstract:
Proposing distributed path computation with intermediate variables (DIV) algorithm that enables distributed, lightweight, loop-free path computation. it can run on top of any routing algorithm to provide loopfreedom.

Existing System:
1)Existing Approaches are (i) link-state algorithms and (ii) distance-vector algorithms. 2) Inconsistent information at different nodes can have dire consequences that extend beyond not achieving the desired efficiency. 3) formation of transient routing loops which can severely impact network performance.

Proposed System:
1)
Separation of Routing and Loop prevention:DIV separates routing algorithms from the task of transient loop prevention. to increase the robustness of the network able to reroute packets immediately (i.e., without the need for any route update) without causing 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 reduces the 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 and respond to the updates in an arbitrary manner, enabling an additional dimension for optimization. 5) Robustness: DIV can tolerate arbitrary packet reordering and losses without sacrificing correctness

Introduction
Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks.

ALGORITHM

USE-CASE DIAGRAM
fileprocessing

Acyclic Routing Configuration sender destination

Backup Configuration

Client Side Information

SEQUENCE DIAGRAM
client File processing Router Path Configuration Destination

file Transmitting

sending file to router

Router failure

Information to client

Transferring file using back up Configuration

CLASS DIAGRAM

Modules:
1) Distributed Time-to-Live Module 2) Loop Free Routing Module 3) Robust Routing Module

Distributed Time-to-Live Module

Time-to-Live (TTL) field in packet headers or a TTL set to a large value. In the presence of a routing loop. a packet caught in the loop comes back to the same nodes repeatedly. increasing the traffic load many folds on the affected links and nodes. Avoiding transient routing loops for path computation

Loop Free Routing Module

each node depends on the computation results of its neighbors, which can introduce cyclic dependencies that increase the number of steps needed to reach a final. Reduced overhead Convergence Time

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 nodes ability to continue forwarding 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

SCREENS

SCREENS

SCREENS

SCREENS

CONCLUSION
Distance-vector algorithms have advantages over link-state algorithms, lower resource requirements and often greater stability by keeping the impact of changes local.

FUTURE WORK
Future research on improving performance of convergence rate of the preferred techniques.

REFERENCE:
Gagan Raj Gupta, Ness B. Shroff, Delay Analysis and Optimality of Scheduling Policies for Multi-Hop Wireless Networks, IEEE/ACM Transactions on Networking, Vol. 19, No.1, Feb 2011. [2] L. Bui, R. Srikant, and A. L. Stolyar. Novel architectures and algorithms for delay reduction in back-pressure scheduling and routing. INFOCOM Mini-Conference, 2009.

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.

Software Requirements:
Operating system : - Windows XP. Coding Language : -JAVA, Swing, RMI, J2ME(Wireless Toolkit) Tool Used : - Eclipse 3.3