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

internet-drafts@ietf.org Tue, 05 December 2023 09:46 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 52EB8C17C8AC; Tue, 5 Dec 2023 01:46:52 -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
Cc: lsr@ietf.org
X-Test-IDTracker: no
X-IETF-IDTracker: 11.16.0
Auto-Submitted: auto-generated
Precedence: bulk
Reply-To: lsr@ietf.org
Message-ID: <170176961231.46401.12780378681471830826@ietfa.amsl.com>
Date: Tue, 05 Dec 2023 01:46:52 -0800
Archived-At: <https://mailarchive.ietf.org/arch/msg/lsr/BktdJNPYhH17xANADmSmpb2gYCI>
Subject: [Lsr] I-D Action: draft-ietf-lsr-algorithm-related-adjacency-sid-06.txt
X-BeenThere: lsr@ietf.org
X-Mailman-Version: 2.1.39
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: Tue, 05 Dec 2023 09:46:52 -0000

Internet-Draft draft-ietf-lsr-algorithm-related-adjacency-sid-06.txt is now
available. It is a work item of the Link State Routing (LSR) WG of the IETF.

   Title:   Algorithm Related IGP-Adjacency SID Advertisement
   Authors: Shaofu Peng
            Ran Chen
            Ketan Talaulikar
            Peter Psenak
   Name:    draft-ietf-lsr-algorithm-related-adjacency-sid-06.txt
   Pages:   16
   Dates:   2023-12-05

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 Internet-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-06

A diff from the previous version is available at:
https://author-tools.ietf.org/iddiff?url2=draft-ietf-lsr-algorithm-related-adjacency-sid-06

Internet-Drafts are also available by rsync at:
rsync.ietf.org::internet-drafts