I-D Action: draft-peng-lsr-algorithm-related-adjacency-sid-02.txt
internet-drafts@ietf.org Mon, 07 December 2020 12:38 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 A4BFF3A138A for <i-d-announce@ietf.org>; Mon, 7 Dec 2020 04:38:11 -0800 (PST)
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-02.txt
X-Test-IDTracker: no
X-IETF-IDTracker: 7.23.0
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <160734469163.29939.12387322639738004319@ietfa.amsl.com>
Date: Mon, 07 Dec 2020 04:38:11 -0800
Archived-At: <https://mailarchive.ietf.org/arch/msg/i-d-announce/vMgIGnyWakrcVlw_LFN6Fk9ChNk>
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: Mon, 07 Dec 2020 12:38:12 -0000
A New Internet-Draft is available from the on-line Internet-Drafts directories. Title : Algorithm Related IGP-Adjacency SID Advertisement Authors : Shaofu Peng Ran Chen Ketan Talaulikar Filename : draft-peng-lsr-algorithm-related-adjacency-sid-02.txt Pages : 11 Date : 2020-12-07 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-02 https://datatracker.ietf.org/doc/html/draft-peng-lsr-algorithm-related-adjacency-sid-02 A diff from the previous version is available at: https://www.ietf.org/rfcdiff?url2=draft-peng-lsr-algorithm-related-adjacency-sid-02 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/
- I-D Action: draft-peng-lsr-algorithm-related-adja… internet-drafts