YANG Model for IGP Flexible Algorithm
draft-rasool-lsr-flex-algo-yang-00

Document Type Active Internet-Draft (individual)
Last updated 2019-04-28
Stream (None)
Intended RFC status (None)
Formats plain text xml pdf html bibtex
Yang Validation 5 errors, 0 warnings.
Additional URLs
- Yang catalog entry for ietf-flex-algo@2019-04-26.yang
- Yang impact analysis for draft-rasool-lsr-flex-algo-yang
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
LSR                                                       M. Rasool, Ed.
Internet-Draft                                       S. Sreenivasan, Ed.
Intended status: Standards Track                            M. Negi, Ed.
Expires: October 28, 2019                            Huawei Technologies
                                                          April 26, 2019

                 YANG Model for IGP Flexible Algorithm
                   draft-rasool-lsr-flex-algo-yang-00

Abstract

   This document describes a YANG data model for IGP Flexible Algorithm.
   The model serves as a base framework for configuring and managing
   Flexible Algorithms which is used by IGPs to compute constraint based
   paths over the network.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on October 28, 2019.

Copyright Notice

   Copyright (c) 2019 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (https://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Rasool, et al.          Expires October 28, 2019                [Page 1]
Internet-Draft                  FLEX-YANG                     April 2019

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Requirements Language . . . . . . . . . . . . . . . . . . . .   3
   3.  Terminology and Notation  . . . . . . . . . . . . . . . . . .   3
   4.  Design of Data Model  . . . . . . . . . . . . . . . . . . . .   3
     4.1.  Overview  . . . . . . . . . . . . . . . . . . . . . . . .   3
     4.2.  Flex-Algorithm Types  . . . . . . . . . . . . . . . . . .   4
     4.3.  Flex-Algorithm Data Model . . . . . . . . . . . . . . . .   4
       4.3.1.  YANG Model Tree . . . . . . . . . . . . . . . . . . .   4
       4.3.2.  Notifications . . . . . . . . . . . . . . . . . . . .   7
   5.  Interaction with Other YANG Modules . . . . . . . . . . . . .   7
   6.  Flex-Algorithm YANG Module  . . . . . . . . . . . . . . . . .   8
   7.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .  16
   8.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  16
   9.  Security Considerations . . . . . . . . . . . . . . . . . . .  16
   10. References  . . . . . . . . . . . . . . . . . . . . . . . . .  16
     10.1.  Normative References . . . . . . . . . . . . . . . . . .  16
     10.2.  Informative References . . . . . . . . . . . . . . . . .  18
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  18

1.  Introduction

   The Network Configuration Protocol (NETCONF) [RFC6241] is one of the
   network management protocols that defines mechanisms to manage
   network devices.  YANG [RFC6020] is a modular language that
   represents data structures in an XML tree format, and is used as a
   data modeling language for the NETCONF.

   IGP Flexible Algorithm as defined in [I-D.ietf-lsr-flex-algo],
   proposes a solution that allows IGPs themselves to compute constraint
   based paths over the network.  It also specifies a way of using
   Segment Routing Prefix-SIDs to steer packets along the constraint-
   based paths.

   This document describes a YANG [RFC7950] data model for IGP Flexible
   Algorithms.  The model serves as a base framework for configuring and
   managing Flexible Algorithm which is used by IGPs to compute
   constraint based paths over the network.

   IGP protocols like IS-IS and OSPF uses this Flexible algorithm
   definition in their YANG models defined in :

   o  [I-D.hu-lsr-ospf-srv6-yang]

   o  [I-D.hu-isis-srv6-yang]

   o  [I-D.ietf-isis-sr-yang],

Rasool, et al.          Expires October 28, 2019                [Page 2]
Internet-Draft                  FLEX-YANG                     April 2019

   o  [I-D.ietf-ospf-sr-yang].

   The model currently defines the following constructs that are used
   for managing Flexible Algorithm:
Show full document text