Fast Ip Recovery 2

8/3/2019 Fast Ip Recovery 2

1/13

Multiple RoutingConfigurations

for Fast IP Network Recovery


2/13

Abstract

MRC is strictly connectionless, and assumesonly destination based hop-by-hopforwarding.

MRC is based on keeping additional routinginformation in the routers, and allows packetforwarding to continue on an alternativeoutput link immediately after the detection ofa failure. It can be implemented with only

minor changes to existing solutions.

In this paper we present MRC, and analyzeits performance with respect to scalability,backup path lengths, and load distributionafter a failure.


3/13

System Analysis - ExistingSystem Simplistic Cycle Elimination (SCE) approach, is prone to

problems when the reduced connectivity has a negativeeffect on response time and on the ability of returningenough results.

Disadvantages:

None of the techniques fully deals with duplicateelimination.

Overloads the network with unnecessary messages.

A slow peer causes bottlenecks.

Prone to problems when multiple nodes in a cycleperform this cycle elimination operation simultaneously


4/13

System Analysis - ProposedSystem

In contrast to SCE, the proposed protocol requiresnegotiation among all peers involved in a cycle about theoptimal way to cut the cycle. Therefore, the probability ofgenerating a disconnected network is minimized.

The negotiation process can be initiated by any peer thatreceives a duplicate.

It reduces duplicate messages by as much as 90 percent.

It requires few control messages; therefore, the overhead isminimal.

It is suitable for dynamic networks with frequent peer arrivals anddepartures/failures since it is fully distributed and requires onlylocalized changes to the networks structure.

There is a trade-off between eliminating the cycles andmaintaining the connectivity of the network.


5/13

Flow Diagram

Send

Message

Next

Node Hop

Message

Duplication

Receive

Message

Forward

Request

Disconnect

Node

Receiver

Node

message message

Sender

Node


6/13

Data Flow Diagram


7/13

Activity Diagram


8/13

Use Case Diagram


9/13

Modules

Client Module

Network Node Discovery Module

Source Selection Module for messagebroadcasting

Message Broadcasting and Transmission Module

Report Module

Server Module

Message Duplication algorithm

Graphical Output Module


10/13

Modules Description

Network Node Discovery Module

This GUI module provides a general way of discovering network elements, ornodes, connected to a computer network, and a specific algorithm for discoveringnodes connected to a TCP/IP network. After all the nodes on a network arediscovered, they are displayed on the screen.

Source Selection Module for message broadcasting

This User interface module helps to select a source node to broadcast messageto many receiver nodes.

Message Broadcasting and Transmission Module

In a networking technology that uses messages to send data, there are a numberof tasks that must be undertaken in order to successfully transmit the data fromone place to another.


11/13

Modules Description

Server Module

Servers are any computer with resources (such as printersand disks) to be shared. Clients are entities that want to usethese resources.

Servers listen to their socket ports waiting for a client toconnect with a service request. Servers are multithreaded topermit multiple services and multiple connects to the sameservice simultaneously.

Proxy servers speak the client side of the protocol to anotherserver. It acts as an agent of the client and can be set up tofilter or cache data for it.


12/13

Conclusion

MRC operates without knowing the root cause offailure, i.e., whether the forwarding disruption iscaused by a node or link failure.

This is achieved by using careful link weightassignment according to the rules we havedescribed.

The link weight assignment rules also providebasis for the specification of a forwardingprocedure that successfully solves the last hopproblem.


13/13

References

D. D. Clark, The design philosophy of the DARPAinternet protocols, SIGCOMM, ComputerCommunications Review, vol. 18, no. 4, pp. 106114,Aug. 1988.

C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian,Delayed Internet Routing Convergence, IEEE/ACMTransactions on Networking, vol. 9, no. 3, pp. 293306,June 2001.

Y. Wang, Z. Wang, and L. Zhang, Internet trafficengineering without full mesh overlaying, inProceedings INFOCOM, Apr. 2001, pp. 565571.

Documents

Fast Ip Recovery 2