LFA selection for Multi-Homed Prefixes
draft-psarkar-rtgwg-multihomed-prefix-lfa-04

Document Type Replaced Internet-Draft (candidate for rtgwg WG)
Last updated 2017-01-09 (latest revision 2016-07-08)
Replaced by draft-ietf-rtgwg-multihomed-prefix-lfa
Stream IETF
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream WG state Call For Adoption By WG Issued
Document shepherd No shepherd assigned
IESG IESG state Replaced by draft-ietf-rtgwg-multihomed-prefix-lfa
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-psarkar-rtgwg-multihomed-prefix-lfa-04.txt

Abstract

This document shares experience gained from implementing algorithms to determine Loop-Free Alternates for multi-homed prefixes. In particular, this document provides explicit inequalities that can be used to evaluate neighbors as a potential alternates for multi-homed prefixes. It also provides detailed criteria for evaluating potential alternates for external prefixes advertised by OSPF ASBRs.

Authors

Pushpasis Sarkar (pushpasis.ietf@gmail.com)
Shraddha Hegde (shraddha@juniper.net)
Chris Bowers (cbowers@juniper.net)
Uma Chunduri (uma.chunduri@ericsson.com)
Jeff Tantsura (jefftant.ietf@gmail.com)
Bruno Decraene (bruno.decraene@orange.com)
Hannes Gredler (hannes@gredler.at)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)