Multiple Routing Configurations for Fast IP Network Recovery
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
project report helper
Active In SP
**

Posts: 2,270
Joined: Sep 2010
#1
25-09-2010, 04:21 PM



.pdf   JIEE521.pdf (Size: 717.4 KB / Downloads: 320)
Multiple Routing Configurations for Fast
IP Network Recovery


presented by:-
Amund Kvalbein, Member, IEEE, Audun Fosselie Hansen, Tarik ˇ Ciˇcic´, Member, IEEE,
Stein Gjessing, Member, IEEE, and Olav Lysne, Member, IEEE



abstract
Internet takes an increasingly central role
in our communications infrastructure, the slow convergence of
routing protocols after a network failure becomes a growing
problem. To assure fast recovery from link and node failures in
IP networks, we present a new recovery scheme called Multiple
Routing Configurations (MRC). Our proposed scheme guarantees
recovery in all single failure scenarios, using a single mechanism to
handle both link and node failures, and without knowing the root
cause of the failure. 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.We also
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.

Reply
swathikinthali
Active In SP
**

Posts: 7
Joined: Mar 2010
#2
07-10-2010, 10:08 AM

Hi can anyone help me with documentation of "Multiple Routing Configurations for Fast IP Network Recovery"
Reply
seminar surveyer
Active In SP
**

Posts: 3,541
Joined: Sep 2010
#3
15-11-2010, 01:39 PM

visit the below threads too for more details on 'Multiple Routing Configurations for Fast IP Network Recovery'

topicideashow-to-need-help-in-coding-multiple-routing-configurations-for-fast-ip-network-recovery
topicideashow-to-fast-ip-network-recovery-using-multiple-routing-configurations?pid=27467#pid27467
Reply
jyothsna devi
Active In SP
**

Posts: 1
Joined: Dec 2010
#4
03-12-2010, 12:43 PM

hai sir,
iam Jyothsna Devi, student of M. Tech(cs) in JNTU-HYD, now iam in project and implimentation. iam selected my M.tech project and implimentation as Multiple routing configurations for fast ip networks recovery. i need ur help for making project and implimentation report. so plaese guide me how to prepare report on this this.
thanking u
jyothsna
Reply
seminar surveyer
Active In SP
**

Posts: 3,541
Joined: Sep 2010
#5
04-12-2010, 08:32 AM

first post containing an attachment file.please download it. and threads are given for more details in another post. please go through them. then you have any problem, please contact us.
Reply
seminar class
Active In SP
**

Posts: 5,361
Joined: Feb 2011
#6
28-02-2011, 03:02 PM

presented by:
VINOTH.H


.pptx   vino.pps.pptx (Size: 168.97 KB / Downloads: 136)
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 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 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 link and node failures, and without knowing the root cause of the failure
 we propose a deflection routing algorithm to tackle 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 link overload, without requiring any changes to the routing protocol
System Specification
Hardware Requirements:

System Tongueentium 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 : Wi
ndows XP Professional.
Front End : JAVA.
Coding Language : Eclipse
COMPONENT DIAGRAM
Reply
balaraju
Active In SP
**

Posts: 1
Joined: Jan 2011
#7
08-03-2011, 10:05 PM

hai vinoth gudeveng.........this is Balu MCA.Iam also doing same project and implimentation on MRC for fast IP network recovery please send about this project and implimentation ppts send to balu.buji@gmail.com i want uml diagrms for this project and implimentation because 26 march 1st review is there.If u have please send me friend..........
Reply
seminar class
Active In SP
**

Posts: 5,361
Joined: Feb 2011
#8
12-03-2011, 04:09 PM


.doc   abstract.doc (Size: 27.5 KB / Downloads: 69)
Multiple Routing Configurations for Fast IP Network Recovery
Abstract—

As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC).. 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. We also 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.
Existing System
Existing work on load distribution in connectionless IGP networks
has either focused on the failure free case or on finding link weights that work well both in the normal case and when the routing protocol has converged after a single link failure Many of the approaches listed provide elegant and efficient solutions to fast network recovery, however MRC and Not-via tunneling seems to be the only two covering all evaluated requirements. However, we argue that MRC offers the same functionality
with a simpler and more intuitive approach, and leaves
More room for optimization with respect to load balancing.
Proposed System
Our proposed scheme guarantees Recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. 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
System Requirements
Hardware:

PROCESSOR : PENTIUM IV 2.6 GHz
RAM : 512 MB
MONITOR : 15”
HARD DISK : 20 GB
CDDRIVE : 52X
KEYBOARD : STANDARD 102 KEYS
MOUSE : 3 BUTTONS
Software:
FRONT END : JAVA, SWING
TOOLS USED : JFRAME BUILDER
OPERATING SYSTEM: WINDOWS XP
Reply
vigneshsarva
Active In SP
**

Posts: 2
Joined: Mar 2011
#9
15-03-2011, 08:37 PM

kindly give full documentation and code for multiple routing configuration ... need as early as possible... help me and save me.....
Reply
seminar class
Active In SP
**

Posts: 5,361
Joined: Feb 2011
#10
31-03-2011, 09:42 AM


.doc   Architecturaldiagram.doc (Size: 29 KB / Downloads: 55)
Multiple Routing Configurations for Fast IP Network Recovery
Abstract

As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. 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.We also 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.
Reply
vigneshsarva
Active In SP
**

Posts: 2
Joined: Mar 2011
#11
31-03-2011, 12:23 PM

need code for this project and implimentation...send the code pls..... as early as possible
Reply
seminar project
Active In SP
**

Posts: 1,080
Joined: Apr 2011
#12
04-05-2011, 10:54 PM

hi
you can refer these pages to get the details on multiple routing configurations for fast IP network recovery


topicideashow-to-fast-ip-network-recovery-using-multiple-routing-configurations

topicideashow-to-multiple-routing-configuration-for-fast-ip-network-recovery

topicideashow-to-need-help-in-coding-multiple-routing-configurations-for-fast-ip-network-recovery

topicideashow-to-multiple-routing-configurations-for-fast-ip-network-recovery

topicideashow-to-multiple-routing-configuration-for-fast-ip-network-recovery?page=4
Reply
Anoushka
Active In SP
**

Posts: 1
Joined: Jul 2011
#13
01-07-2011, 04:46 PM

hiiiiiiiiiiii
please i need uml diagrams for dis mrc project and implimentation can i get it?
please send me as early as possible i need it
Reply
seminar flower
Super Moderator
******

Posts: 10,120
Joined: Apr 2012
#14
24-09-2012, 04:21 PM

MULTIPLE ROUTING CONFIGURATIONS FOR FAST IP NETWORK RECOVERY

ABSTRACT

As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. 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. We also 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.
Reply
seminar flower
Super Moderator
******

Posts: 10,120
Joined: Apr 2012
#15
27-09-2012, 01:54 PM

Fast IP Network Recovery using Multiple Routing Configurations


.pdf   Fast IP Network Recovery.pdf (Size: 153.97 KB / Downloads: 33)

Abstract

As the Internet takes an increasingly central role
in our communications infrastructure, the slow convergence of
routing protocols after a network failure becomes a growing
problem. To assure fast recovery from link and node failures in
IP networks, we present a new recovery scheme called Multiple
Routing Configurations (MRC). 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. Our proposed scheme guarantees
recovery in all single failure scenarios, using a single mechanism
to handle both link and node failures, and without knowing the
root cause of the failure. MRC is strictly connectionless, and
assumes only destination based hop-by-hop forwarding. 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.

INTRODUCTION

In recent years the Internet has been transformed from a
special purpose network to an ubiquitous platform for a wide
range of everyday communication services. The demands on
Internet reliability and availability have increased accordingly.
A disruption of a link in central parts of a network has the potential
to affect hundreds of thousands of phone conversations
or TCP connections, with obvious adverse effects.
The ability to recover from failures has always been a central
design goal in the Internet [1]. IP networks are intrinsically
robust, since IGP routing protocols like OSPF are designed
to update the forwarding information based on the changed
topology after a failure. This re-convergence assumes full
distribution of the new link state to all routers in the network
domain. When the new state information is distributed, each
router individually calculates new valid routing tables.

MRC OVERVIEW

MRC is based on using a small set of backup routing
configurations, where each of them is resistant to failures of
certain nodes and links. Given the original network topology, a
configuration is defined as a set of associated link weights. In a
configuration that is resistant to the failure of a particular node
n, link weights are assigned so that traffic routed according to
this configuration is never routed through node n. The failure
of node n then only affects traffic that is sent from or destined
to n. Similarly, in a configuration that is resistant to failure
of a link l, traffic routed in this configuration is never routed
over this link, hence no traffic routed in this configuration is
lost if l fails. In MRC, node n and link l are called isolated
in a configuration, when, as described above, no traffic routed
according to this configuration is routed through n or l.

Termination

The algorithm runs through all nodes trying to make them
isolated in one of the backup configurations. If a node cannot
be isolated in any of the configurations, the algorithm terminates
without success. However, the algorithm is designed so
that any biconnected topology will result in a successful termination,
if the number of configurations allowed is sufficiently
high.
For an intuitive proof of this, look at a situation where
the number of configurations created is |V|. In this case,
the algorithm will only isolate one node in each backup
configuration. In biconnected topologies any node can be
removed, i.e. isolated, without disconnecting the network, and
hence invariant 1 above is not violated. Along with a node vi,
all attached links except one (ei,j ) can be isolated. By forcing
node vj to be the next node processed (line 39), and the link
ej,i to be first among Ej (line 41), we guarantee that ej,i and vj
can be isolated in the next configuration. This can be repeated
until we have configurations so that every node and link is
isolated. This holds also for the last node processed, since its
last link will always lead to a node that is already isolated in
another configuration.

LOCAL FORWARDING PROCESS

The algorithm presented in Sec. III creates a set of backup
configurations. Based on these, a standard shortest path algorithm
is used in each configuration, to calculate configuration
specific forwarding tables. In this section, we describe how
these forwarding tables are used to avoid a failed component.
When a packet reaches a point of failure, the node adjacent
to the failure, called the detecting node, is responsible for finding
the configuration where the failed component is isolated,
and to forward the packet according to this configuration.
With our proposal, the detecting node must find the correct
configuration without knowing the root cause of failure.

PERFORMANCE EVALUATION

MRC is a local, proactive recovery scheme that resumes
packet forwarding immediately after the failure is detected,
and hence provides fast recovery. State requirements and the
influence on network traffic are other important metrics, which
will be evaluated in this section.
MRC requires the routers to store additional routing configurations.
The amount of state required in the routers, is related
to the number of such backup configurations. Since routing in
a backup configuration is restricted, MRC will potentially give
backup paths that are longer than the optimal paths. Longer
backup paths will affect the total network load and also the
end-to-end delay. We use a routing simulator to evaluate these
metrics on a wide range of synthetic topologies. We also use a
packet simulator to study the effect of failures on the network
traffic in one selected topology.

RELATED WORK

Much work has lately been done to improve robustness
against component failures in IP networks [22]. In this section,
we focus on some important contributions aimed at restoring
connectivity without a global re-convergence. Tab. III
summarizes important features of the different approaches.
We indicate whether each mechanism guarantees one-fault
tolerance in an arbitrary biconnected network, for both link
and node failures, independent of the root cause of failure
(failure agnostic). We also indicate whether the approaches
guarantees shortest path routing in the failure-free case, and
whether they solve the ”last hop problem”.

CONCLUSION AND FUTURE WORK

We have presented Multiple Routing Configurations as an
approach to achieve fast recovery in IP networks. MRC is
based on providing the routers with additional routing configurations,
allowing them to forward packets along routes that
avoid a failed component. MRC guarantees recovery from
any single node or link failure in an arbitrary biconnected
network. By calculating backup configurations in advance, and
operating based on locally available information only, MRC
can act promptly after failure discovery.
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 specification of
a forwarding procedure that successfully solves the last hop
problem.
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Message
Type your reply to this message here.


Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Wireless Sensor Network Security model using Zero Knowledge Protocol seminar ideas 2 1,427 31-03-2015, 09:08 AM
Last Post: Guest
  Computerized Paper Evaluation using Neural Network computer science crazy 11 8,931 03-02-2014, 03:21 PM
Last Post: Guest
  Network Reconfiguration Using a Genetic Approach for Loss and Reliability Optimizati project report helper 1 1,590 16-10-2013, 05:35 AM
Last Post: dreambanned
  Design of an Error Detection and Data Recovery Architecture for Motion Estimation seminar projects maker 0 763 30-09-2013, 04:40 PM
Last Post: seminar projects maker
  SIMULATION OF NETWORK PROTOCOLS: M/M/1 and M/M/1/N queues. seminar projects maker 0 415 25-09-2013, 04:29 PM
Last Post: seminar projects maker
  DATA STRUCTURES USED IN NETWORK PROGRAMMING seminar projects maker 0 557 25-09-2013, 04:27 PM
Last Post: seminar projects maker
  ppt on Wireless Mesh Network seminar projects maker 0 473 25-09-2013, 02:52 PM
Last Post: seminar projects maker
  Fast algorithms for solving H∞-norm minimization problems pdf seminar projects maker 0 306 23-09-2013, 04:31 PM
Last Post: seminar projects maker
  Routing in Wireless Ad Hoc Networks pdf seminar projects maker 0 305 21-09-2013, 01:05 PM
Last Post: seminar projects maker
  Report on Local Area Network (LAN) seminar projects maker 0 361 13-09-2013, 11:39 AM
Last Post: seminar projects maker