I-D Action: draft-peng-lsr-algorithm-related-adjacency-sid-01.txt

internet-drafts@ietf.org Sun, 27 September 2020 02:41 UTC

Return-Path: <internet-drafts@ietf.org>
X-Original-To: i-d-announce@ietf.org
Delivered-To: i-d-announce@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id D63F53A0E67 for <i-d-announce@ietf.org>; Sat, 26 Sep 2020 19:41:00 -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
Subject: I-D Action: draft-peng-lsr-algorithm-related-adjacency-sid-01.txt
X-Test-IDTracker: no
X-IETF-IDTracker: 7.17.0
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <160117446083.31899.2733150914870996183@ietfa.amsl.com>
Date: Sat, 26 Sep 2020 19:41:00 -0700
Archived-At: <https://mailarchive.ietf.org/arch/msg/i-d-announce/xDabsrR4_pp1Wt_GhGmHO2kz49s>
X-BeenThere: i-d-announce@ietf.org
X-Mailman-Version: 2.1.29
List-Id: Internet Draft Announcements only <i-d-announce.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/i-d-announce>, <mailto:i-d-announce-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/i-d-announce/>
List-Post: <mailto:i-d-announce@ietf.org>
List-Help: <mailto:i-d-announce-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/i-d-announce>, <mailto:i-d-announce-request@ietf.org?subject=subscribe>
X-List-Received-Date: Sun, 27 Sep 2020 02:41:01 -0000

A New Internet-Draft is available from the on-line Internet-Drafts directories.


        Title           : Algorithm Related IGP-Adjacency SID Advertisement
        Authors         : Peng Shaofu
                          Chen Ran
	Filename        : draft-peng-lsr-algorithm-related-adjacency-sid-01.txt
	Pages           : 11
	Date            : 2020-09-26

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-peng-lsr-algorithm-related-adjacency-sid/

There are also htmlized versions available at:
https://tools.ietf.org/html/draft-peng-lsr-algorithm-related-adjacency-sid-01
https://datatracker.ietf.org/doc/html/draft-peng-lsr-algorithm-related-adjacency-sid-01

A diff from the previous version is available at:
https://www.ietf.org/rfcdiff?url2=draft-peng-lsr-algorithm-related-adjacency-sid-01


Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org.

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