Skip to main content

IGP Flexible Algorithms (Flex-Algorithm) In IP Networks
draft-bonica-lsr-ip-flexalgo-01

Document Type Replaced Internet-Draft (lsr WG)
Authors William Britto , Shraddha Hegde , Parag Kaneriya , Rejesh Shetty , Ron Bonica , Peter Psenak
Last updated 2020-12-20 (Latest revision 2020-11-15)
Replaced by draft-ietf-lsr-ip-flexalgo
Stream Internet Engineering Task Force (IETF)
Intended RFC status (None)
Formats
Expired & archived
plain text xml htmlized pdfized bibtex
Stream WG state Adopted by a WG
Document shepherd (None)
IESG IESG state Replaced by draft-ietf-lsr-ip-flexalgo
Consensus boilerplate Unknown
Telechat date (None)
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-bonica-lsr-ip-flexalgo-01.txt

Abstract

An IGP Flexible Algorithm (Flex-Algorithm) allows IGP to compute constraint-based paths. As currently defined, IGP Flex-Algorithm is used with Segment Routing (SR) data planes - SR MPLS and SRv6. Therefore, Flex-Algorithm cannot be deployed in the absence of SR. This document extends IGP Flex-Algorithm, so that it can be used for regular IPv4 and IPv6 prefixes. This allows Flex-Algorithm to be deployed in any IP network, even in the absence of SR.

Authors

William Britto
Shraddha Hegde
Parag Kaneriya
Rejesh Shetty
Ron Bonica
Peter Psenak

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