Multiple Routing Congurations for Fast IP Network Recovery

Abstract
MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure.

System Analysis - Existing System

Simplistic Cycle Elimination (SCE) approach, is prone to problems when the reduced connectivity has a negative effect on response time and on the ability of returning enough results.

Disadvantages: None of the techniques fully deals with duplicate elimination. Overloads the network with unnecessary messages. A slow peer causes bottlenecks. Prone to problems when multiple nodes in a cycle perform this cycle elimination operation simultaneously

System Analysis - Proposed System

In contrast to SCE, the proposed protocol requires negotiation among all peers involved in a cycle about the optimal way to cut the cycle. Therefore, the probability of generating a disconnected network is minimized. The negotiation process can be initiated by any peer that receives a duplicate.
It reduces duplicate messages by as much as 90 percent. It requires few control messages; therefore, the overhead is minimal. It is suitable for dynamic networks with frequent peer arrivals and departures/failures since it is fully distributed and requires only localized changes to the networks structure. There is a trade-off between eliminating the cycles and maintaining the connectivity of the network.

Flow Diagram
Sender Node

Send Message

Receive Message

message

Receiver Node message

Next Node Hop

Message Duplication Forward Request

Disconnect Node

Data Flow Diagram

Activity Diagram

Use Case Diagram

Modules
Client Module
Network Node Discovery Module Source Selection Module for message broadcasting Message Broadcasting and Transmission Module Report Module

Server Module
Message Duplication algorithm Graphical Output Module

Modules Description
Network Node Discovery Module

This GUI module provides a general way of discovering network elements, or nodes, connected to a computer network, and a specific algorithm for discovering nodes connected to a TCP/IP network. After all the nodes on a network are discovered, they are displayed on the screen.
Source Selection Module for message broadcasting This User interface module helps to select a source node to broadcast message to many receiver nodes. Message Broadcasting and Transmission Module In a networking technology that uses messages to send data, there are a number of tasks that must be undertaken in order to successfully transmit the data from one place to another.

Modules Description
Server Module

Servers are any computer with resources (such as printers and disks) to be shared. Clients are entities that want to use these resources. Servers listen to their socket ports waiting for a client to connect with a service request. Servers are multithreaded to permit multiple services and multiple connects to the same service simultaneously.
Proxy servers speak the client side of the protocol to another server. It acts as an agent of the client and can be set up to filter or cache data for it.

Conclusion

MRC operates without knowing the root cause of failure, i.e., whether the forwarding disruption is caused by a node or link failure. This is achieved by using careful link weight assignment according to the rules we have described. The link weight assignment rules also provide basis for the specication of a forwarding procedure that successfully solves the last hop problem.

References

D. D. Clark, The design philosophy of the DARPA internet protocols, SIGCOMM, Computer Communications Review, vol. 18, no. 4, pp. 106114, Aug. 1988. C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian, Delayed Internet Routing Convergence, IEEE/ACM Transactions on Networking, vol. 9, no. 3, pp. 293306, June 2001. Y. Wang, Z. Wang, and L. Zhang, Internet trafc engineering without full mesh overlaying, in Proceedings INFOCOM, Apr. 2001, pp. 565571.