28-02-2011, 03:02 PM
presented by:
VINOTH.H
[attachment=9231]
Multiple Routing Configurations for Fast IP Network Recovery
INTRODUCTION:
Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem
The demands on Internetreliability and availability have increased accordingly
To assure fast recovery from page link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC)
MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding
GOALS
The goal of our work is to first understand how links become overloaded in an IP backbone, and then to explore if the routing protocol, -either in its existing form, or in some enhanced form could be made to respond immediately to overload and reduce the likelihood of its occurrence
We show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used
we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure
Existing System
when a page link is overloaded, few (if any) other links in the network are also overloaded
There are no back ups when the transmission fails
Shortest path routing protocols may suffer from congestion due to the use of a single shortest path between a source and a destination
Link overloads are not tackled
Proposed System
Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both page link and node failures, and without knowing the root cause of the failure
we propose a deflection routing algorithm to tackle page link overload where each node makes local decisions
Provides backup for the informations and also helps in secure transmission
Simulations suggest that this can be a simple and efficient way to overcome page link overload, without requiring any changes to the routing protocol
System Specification
Hardware Requirements:
System
entium iv 2.4 GHz.
Hard disk : 40 GB.
Floppy disk :1.44 Mb.
Monitor :15 VGA Color.
Mouse :Logitech.
Ram :256Mb.
Software Requirements:
Operating system : Windows XP Professional.
Front End : JAVA.
Coding Language : Eclipse
COMPONENT DIAGRAM
VINOTH.H
[attachment=9231]
Multiple Routing Configurations for Fast IP Network Recovery
INTRODUCTION:
Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem
The demands on Internetreliability and availability have increased accordingly
To assure fast recovery from page link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC)
MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding
GOALS
The goal of our work is to first understand how links become overloaded in an IP backbone, and then to explore if the routing protocol, -either in its existing form, or in some enhanced form could be made to respond immediately to overload and reduce the likelihood of its occurrence
We show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used
we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure
Existing System
when a page link is overloaded, few (if any) other links in the network are also overloaded
There are no back ups when the transmission fails
Shortest path routing protocols may suffer from congestion due to the use of a single shortest path between a source and a destination
Link overloads are not tackled
Proposed System
Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both page link and node failures, and without knowing the root cause of the failure
we propose a deflection routing algorithm to tackle page link overload where each node makes local decisions
Provides backup for the informations and also helps in secure transmission
Simulations suggest that this can be a simple and efficient way to overcome page link overload, without requiring any changes to the routing protocol
System Specification
Hardware Requirements:
System
entium iv 2.4 GHz.Hard disk : 40 GB.
Floppy disk :1.44 Mb.
Monitor :15 VGA Color.
Mouse :Logitech.
Ram :256Mb.
Software Requirements:
Operating system : Windows XP Professional.
Front End : JAVA.
Coding Language : Eclipse
COMPONENT DIAGRAM
