Fast recovery in IP networks using Multiple Routing Configurations
#1

Presented by:
Amund Kvalbein

[attachment=9646]
Fast recovery in IP networks using Multiple Routing Configurations
Motivation
• Increasing use of the Internet for applications with stringent performance requirements
– Telephony, videoconferencing, online games
– ISPs must adhere to tough SLAs
• The recovery mechanisms in the Internet are not designed for these requirements
– Many (most) failures are short lived
– Failures are advertised too widely!
– This gives slow reaction and fosters instability
Our approach
• Failure reaction should be local
– To avoid instability and overhead
– Challenge: avoid loops
– Failure reaction should be proactive
– To reduce recovery times and packet loss
– Challenge: minimize overhead
Outline
• Multiple Routing Configurations
– The basic idea
– Generating backup configurations
– Forwarding
• Evaluation
• Load balancing improvement
• Implementation issues
• Wrap up
• Multiple Routing Configurations
• Guaranteed protection against single link, node or SRLG failures
• Same mechanism for both page link and node failures
– Generally difficult to distinguish at neighbor
• A configuration is the graph and the weight function
– Different weight setting in each configuration
• The general observation
• An unused page link can fail without consequences
• So can a single-connected node
• Several links and/or nodes can be protected in one logical topology
– All nodes are still reachable
• Build topologies so that all elements are protected
– Few such topologies are needed to protect all elements!
Isolated links and nodes
• An isolated page link has infinite weight
• A restricted page link has a high weight wr
– wr is chosen so that the page link is used only as a ”last resort”
• A node is isolated when all attached links are either isolated or restricted
Building backup configurations
• Forwarding
• How many configurations are needed?
• How long are the backup paths?
What about load distribution?
• Why bother to avoid overload?
- it’s only for short while…
Motivation for fast rerouting
– Do not loose packets
– Increase stability
• FRR should not make it worse for unaffected traffic
Routing performance during FRR
• Given TM estimate: What decides the load distribution?
– Link weights in C0
– Structure of backup configurations
– Link weights in backup configurations
• Three step approach
– Optimize page link weights in C0
– Build backup configurations
– Optimize page link weights in backup configurations
Building backup configurations
• Optimize C0 independently
• Identify the ”heaviest” nodes (most traffic)
• Build configs with good connectivity for heavy nodes
Optimizing page link weights
• Heavy optimization task
– Dependencies between configurations
• Local weight search heuristic
– Based on well known Fortz/Thorup method
• Optimize only for most severe page link failures
• Take advantage of configuration structure
– A page link failure only activates one or two backup configurations
Evaluation – Max page link load
• Real and synthetic network topologies
• Gravity model traffic demands
Evaluation – Number of configurations
• Implementation issues
• Representing backup configurations
– IETF: Multi-Topology routing
• Can calculate independent shortest path trees in each topology
• Need ability to switch configuration in-flight
• Marking packets
– Same problem as in MT-routing
– Reuse of ToS/DSCP bits has been proposed
Summary
• MRC guarantees protection against any single page link or node failure
• Modest state overhead
• Small path length stretch for recovered traffic
• Flexibility in how recovered traffic is routed
• Realistic to implement
Related work
• Failure Insensitive Routing (FIR)
– Relies on interface-specific routing tables to infer page link failures
• Not-via addresses
– Calculates one ”configuration” for each protected element
MRC extensions
• Multi-failure protection
– SRLG, uncorrelated failures
– Can guarantee protection against two independent failures (at a cost)
• Improved configuration construction
– Eliminate isolated links
– Use deflection in forwarding procedure
• Use in TE context
– Spread demands on several topologies
• Lab implementation
– Using Quagga routing software
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
Popular Searches: uml diagrams for multiple routing configuration for fast ip recovery, fast ip routing project, architecture for multiple routing configurations for fast ip network recovery, multiple routing configurations for fast ip network recovery code, literature survey for multiple routing configurations for fast ip network recovery, networks employ link protection to achieve fast recovery from link failureswhile the first link failure can be protected usin, multiplerouting configuration for fast ip recovery ppt,

[-]
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
  computer networks full report seminar topics 8 42,021 06-10-2018, 12:35 PM
Last Post: jntuworldforum
  Vertical Handoff Decision Algorithm Providing Optimized Performance in Heterogeneous Wireless Networks computer science topics 2 30,175 07-10-2016, 09:02 AM
Last Post: ijasti
  Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks seminar surveyer 3 2,816 14-07-2015, 02:24 PM
Last Post: seminar report asees
  Heterogeneous Wireless Sensor Networks in a Tele-monitoring System for Homecare electronics seminars 2 2,546 26-02-2015, 08:03 PM
Last Post: Guest
  W-CDMA : Wideband Code-Division Multiple Access computer science crazy 3 4,113 20-09-2014, 07:21 PM
Last Post: seminar report asees
  Shallow Water Acoustic Networks (SWANs project report helper 2 1,852 24-03-2014, 10:10 PM
Last Post: seminar report asees
  Bluetooth Based Smart Sensor Networks (Download Full Seminar Report) Computer Science Clay 75 53,820 16-02-2013, 10:16 AM
Last Post: seminar details
  FACE RECOGNITION USING NEURAL NETWORKS (Download Seminar Report) Computer Science Clay 70 31,771 01-02-2013, 09:28 PM
Last Post: Guest
  Ethernet Passive Optical Networks computer science crazy 1 2,759 12-01-2013, 12:00 PM
Last Post: seminar details
  SEMINAR REPORT on Adaptive Routing in Adhoc Networks Computer Science Clay 2 4,928 02-01-2013, 10:25 AM
Last Post: seminar details

Forum Jump: