[New-wg-docs] 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: new-wg-docs@ietf.org
Delivered-To: new-wg-docs@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id 707433A228D for <new-wg-docs@ietf.org>; 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: new-wg-docs@ietf.org
X-Test-IDTracker: no
X-IETF-IDTracker: 7.31.0
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <162337506143.10880.4667647636770598923@ietfa.amsl.com>
Date: Thu, 10 Jun 2021 18:31:01 -0700
Archived-At: <https://mailarchive.ietf.org/arch/msg/new-wg-docs/oNBf_mflcNpnCXtdTigKo3s97fA>
Subject: [New-wg-docs] I-D Action: draft-ietf-lsr-algorithm-related-adjacency-sid-00.txt
X-BeenThere: new-wg-docs@ietf.org
X-Mailman-Version: 2.1.29
List-Id: <new-wg-docs.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/new-wg-docs>, <mailto:new-wg-docs-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/new-wg-docs/>
List-Post: <mailto:new-wg-docs@ietf.org>
List-Help: <mailto:new-wg-docs-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/new-wg-docs>, <mailto:new-wg-docs-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/
- [New-wg-docs] I-D Action: draft-ietf-lsr-algorith… internet-drafts