[Lsr] I-D Action: draft-ietf-lsr-algorithm-related-adjacency-sid-00.txt

internet-drafts@ietf.org Fri, 11 June 2021 01:31 UTC

Return-Path: <internet-drafts@ietf.org>
X-Original-To: lsr@ietf.org
Delivered-To: lsr@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id 4ECBE3A228B; Thu, 10 Jun 2021 18:31:01 -0700 (PDT)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: i-d-announce@ietf.org
Cc: lsr@ietf.org
X-Test-IDTracker: no
X-IETF-IDTracker: 7.31.0
Auto-Submitted: auto-generated
Precedence: bulk
Reply-To: lsr@ietf.org
Message-ID: <162337506115.10880.14094440362513244854@ietfa.amsl.com>
Date: Thu, 10 Jun 2021 18:31:01 -0700
Archived-At: <https://mailarchive.ietf.org/arch/msg/lsr/RVcjdz_zHEvfNMdhlDUAXJmxhJk>
Subject: [Lsr] I-D Action: draft-ietf-lsr-algorithm-related-adjacency-sid-00.txt
X-BeenThere: lsr@ietf.org
X-Mailman-Version: 2.1.29
List-Id: Link State Routing Working Group <lsr.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lsr>, <mailto:lsr-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lsr/>
List-Post: <mailto:lsr@ietf.org>
List-Help: <mailto:lsr-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lsr>, <mailto:lsr-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 11 Jun 2021 01:31:02 -0000

A New Internet-Draft is available from the on-line Internet-Drafts directories.
This draft is a work item of the Link State Routing WG of the IETF.

        Title           : Algorithm Related IGP-Adjacency SID Advertisement
        Authors         : Shaofu Peng
                          Ran Chen
                          Ketan Talaulikar
                          Peter Psenak
	Filename        : draft-ietf-lsr-algorithm-related-adjacency-sid-00.txt
	Pages           : 13
	Date            : 2021-06-10

Abstract:
   Segment Routing architecture supports the use of multiple routing
   algorithms, i.e, different constraint-based shortest-path
   calculations can be supported.  There are two standard algorithms:
   SPF and Strict-SPF, defined in Segment Routing architecture.  There
   are also other user defined algorithms according to Flex-algo
   applicaiton.  However, an algorithm identifier is often included as
   part of a Prefix-SID advertisement, that maybe not satisfy some
   scenarios where multiple algorithm share the same link resource.
   This document complement that the algorithm identifier can be also
   included as part of a Adjacency-SID advertisement


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-ietf-lsr-algorithm-related-adjacency-sid/

There is also an htmlized version available at:
https://datatracker.ietf.org/doc/html/draft-ietf-lsr-algorithm-related-adjacency-sid-00


Internet-Drafts are also available by anonymous FTP at:
ftp://ftp.ietf.org/internet-drafts/