Skip to content

Commit ab4b749

Browse files
mnotmnot
committed
update var
1 parent f73ffcb commit ab4b749

File tree

3 files changed

+338
-2
lines changed

3 files changed

+338
-2
lines changed

‎var/rfc-index.xml‎

Lines changed: 258 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -110842,7 +110842,6 @@
110842110842
<stream>IETF</stream>
110843110843
<area>int</area>
110844110844
<wg_acronym>mobileip</wg_acronym>
110845-
<errata-url>https://www.rfc-editor.org/errata/rfc3543</errata-url>
110846110845
<doi>10.17487/RFC3543</doi>
110847110846
</rfc-entry>
110848110847
<rfc-entry>
@@ -127094,6 +127093,7 @@
127094127093
<publication-status>PROPOSED STANDARD</publication-status>
127095127094
<stream>IETF</stream>
127096127095
<wg_acronym>NON WORKING GROUP</wg_acronym>
127096+
<errata-url>https://www.rfc-editor.org/errata/rfc4012</errata-url>
127097127097
<doi>10.17487/RFC4012</doi>
127098127098
</rfc-entry>
127099127099
<rfc-entry>
@@ -304299,6 +304299,9 @@ with the Network Management Datastore Architecture (NMDA).</p></abstract>
304299304299
<updates>
304300304300
<doc-id>RFC5640</doc-id>
304301304301
</updates>
304302+
<updated-by>
304303+
<doc-id>RFC9830</doc-id>
304304+
</updated-by>
304302304305
<current-status>PROPOSED STANDARD</current-status>
304303304306
<publication-status>PROPOSED STANDARD</publication-status>
304304304307
<stream>IETF</stream>
@@ -317489,6 +317492,9 @@ with the Network Management Datastore Architecture (NMDA).</p></abstract>
317489317492
<page-count>42</page-count>
317490317493
<abstract><p>IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path. This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network. This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.</p></abstract>
317491317494
<draft>draft-ietf-lsr-flex-algo-26</draft>
317495+
<updated-by>
317496+
<doc-id>RFC9843</doc-id>
317497+
</updated-by>
317492317498
<current-status>PROPOSED STANDARD</current-status>
317493317499
<publication-status>PROPOSED STANDARD</publication-status>
317494317500
<stream>IETF</stream>
@@ -335629,6 +335635,44 @@ Protocol (EPP) that allows EPP clients to manage the Time-to-Live
335629335635
<wg_acronym>bess</wg_acronym>
335630335636
<doi>10.17487/RFC9819</doi>
335631335637
</rfc-entry>
335638+
<rfc-entry>
335639+
<doc-id>RFC9820</doc-id>
335640+
<title>Authentication Service Based on the Extensible Authentication Protocol (EAP) for Use with the Constrained Application Protocol (CoAP)</title>
335641+
<author>
335642+
<name>R. Marin-Lopez</name>
335643+
</author>
335644+
<author>
335645+
<name>D. Garcia-Carrillo</name>
335646+
</author>
335647+
<date>
335648+
<month>September</month>
335649+
<year>2025</year>
335650+
</date>
335651+
<format>
335652+
<file-format>HTML</file-format>
335653+
<file-format>TEXT</file-format>
335654+
<file-format>PDF</file-format>
335655+
<file-format>XML</file-format>
335656+
</format>
335657+
<page-count>35</page-count>
335658+
<keywords>
335659+
<kw>CoAP</kw>
335660+
<kw>EAP</kw>
335661+
<kw>EAP lower layer</kw>
335662+
<kw>Internet of Things</kw>
335663+
<kw>IoT</kw>
335664+
<kw>Constrained Node</kw>
335665+
<kw>Smart Object</kw>
335666+
</keywords>
335667+
<abstract><p>This document specifies an authentication service that uses the Constrained Application Protocol (CoAP) as a transport method to carry the Extensible Authentication Protocol (EAP). As such, it defines an EAP lower layer based on CoAP called "CoAP-EAP". One of the main goals is to authenticate a CoAP-enabled Internet of Things (IoT) device (EAP peer) that intends to join a security domain managed by a Controller (EAP authenticator). Secondly, it allows deriving key material to protect CoAP messages exchanged between them based on Object Security for Constrained RESTful Environments (OSCORE), enabling the establishment of a security association between them.</p></abstract>
335668+
<draft>draft-ietf-ace-wg-coap-eap-15</draft>
335669+
<current-status>PROPOSED STANDARD</current-status>
335670+
<publication-status>PROPOSED STANDARD</publication-status>
335671+
<stream>IETF</stream>
335672+
<area>sec</area>
335673+
<wg_acronym>ace</wg_acronym>
335674+
<doi>10.17487/RFC9820</doi>
335675+
</rfc-entry>
335632335676
<rfc-entry>
335633335677
<doc-id>RFC9825</doc-id>
335634335678
<title>Extensions to OSPF for Advertising Prefix Administrative Tags</title>
@@ -335662,6 +335706,47 @@ Protocol (EPP) that allows EPP clients to manage the Time-to-Live
335662335706
<wg_acronym>lsr</wg_acronym>
335663335707
<doi>10.17487/RFC9825</doi>
335664335708
</rfc-entry>
335709+
<rfc-entry>
335710+
<doc-id>RFC9826</doc-id>
335711+
<title>A YANG Data Model for the Path Computation Element Communication Protocol (PCEP)</title>
335712+
<author>
335713+
<name>D. Dhody</name>
335714+
<title>Editor</title>
335715+
</author>
335716+
<author>
335717+
<name>V. Beeram</name>
335718+
</author>
335719+
<author>
335720+
<name>J. Hardwick</name>
335721+
</author>
335722+
<author>
335723+
<name>J. Tantsura</name>
335724+
</author>
335725+
<date>
335726+
<month>September</month>
335727+
<year>2025</year>
335728+
</date>
335729+
<format>
335730+
<file-format>HTML</file-format>
335731+
<file-format>TEXT</file-format>
335732+
<file-format>PDF</file-format>
335733+
<file-format>XML</file-format>
335734+
</format>
335735+
<page-count>108</page-count>
335736+
<keywords>
335737+
<kw>PCE YANG</kw>
335738+
<kw>PCEP YANG</kw>
335739+
<kw>PCC YANG</kw>
335740+
</keywords>
335741+
<abstract><p>This document defines a YANG data model for the management of the Path Computation Element Communication Protocol (PCEP) for communications between a Path Computation Client (PCC) and a Path Computation Element (PCE), or between two PCEs.</p></abstract>
335742+
<draft>draft-ietf-pce-pcep-yang-30</draft>
335743+
<current-status>PROPOSED STANDARD</current-status>
335744+
<publication-status>PROPOSED STANDARD</publication-status>
335745+
<stream>IETF</stream>
335746+
<area>rtg</area>
335747+
<wg_acronym>pce</wg_acronym>
335748+
<doi>10.17487/RFC9826</doi>
335749+
</rfc-entry>
335665335750
<rfc-entry>
335666335751
<doc-id>RFC9828</doc-id>
335667335752
<title>RTP Payload Format for JPEG 2000 Streaming with Sub-Codestream Latency</title>
@@ -335742,6 +335827,130 @@ Protocol (EPP) that allows EPP clients to manage the Time-to-Live
335742335827
<wg_acronym>sidrops</wg_acronym>
335743335828
<doi>10.17487/RFC9829</doi>
335744335829
</rfc-entry>
335830+
<rfc-entry>
335831+
<doc-id>RFC9830</doc-id>
335832+
<title>Advertising Segment Routing Policies in BGP</title>
335833+
<author>
335834+
<name>S. Previdi</name>
335835+
</author>
335836+
<author>
335837+
<name>C. Filsfils</name>
335838+
</author>
335839+
<author>
335840+
<name>K. Talaulikar</name>
335841+
<title>Editor</title>
335842+
</author>
335843+
<author>
335844+
<name>P. Mattes</name>
335845+
</author>
335846+
<author>
335847+
<name>D. Jain</name>
335848+
</author>
335849+
<date>
335850+
<month>September</month>
335851+
<year>2025</year>
335852+
</date>
335853+
<format>
335854+
<file-format>HTML</file-format>
335855+
<file-format>TEXT</file-format>
335856+
<file-format>PDF</file-format>
335857+
<file-format>XML</file-format>
335858+
</format>
335859+
<page-count>36</page-count>
335860+
<abstract><p>A Segment Routing (SR) Policy is an ordered list of segments (also referred to as "instructions") that define a source-routed policy. An SR Policy consists of one or more Candidate Paths (CPs), each comprising one or more segment lists. A headend can be provisioned with these CPs using various mechanisms such as Command-Line Interface (CLI), Network Configuration Protocol (NETCONF), Path Computation Element Communication Protocol (PCEP), or BGP.</p><p> This document specifies how BGP can be used to distribute SR Policy CPs. It introduces a BGP SAFI for advertising a CP of an SR Policy and defines sub-TLVs for the Tunnel Encapsulation Attribute to signal information related to these CPs.</p><p> Furthermore, this document updates RFC 9012 by extending the Color Extended Community to support additional steering modes over SR Policy.</p></abstract>
335861+
<draft>draft-ietf-idr-sr-policy-safi-13</draft>
335862+
<updates>
335863+
<doc-id>RFC9012</doc-id>
335864+
</updates>
335865+
<current-status>PROPOSED STANDARD</current-status>
335866+
<publication-status>PROPOSED STANDARD</publication-status>
335867+
<stream>IETF</stream>
335868+
<area>rtg</area>
335869+
<wg_acronym>idr</wg_acronym>
335870+
<doi>10.17487/RFC9830</doi>
335871+
</rfc-entry>
335872+
<rfc-entry>
335873+
<doc-id>RFC9831</doc-id>
335874+
<title>Segment Type Extensions for BGP Segment Routing (SR) Policy</title>
335875+
<author>
335876+
<name>K. Talaulikar</name>
335877+
<title>Editor</title>
335878+
</author>
335879+
<author>
335880+
<name>C. Filsfils</name>
335881+
</author>
335882+
<author>
335883+
<name>S. Previdi</name>
335884+
</author>
335885+
<author>
335886+
<name>P. Mattes</name>
335887+
</author>
335888+
<author>
335889+
<name>D. Jain</name>
335890+
</author>
335891+
<date>
335892+
<month>September</month>
335893+
<year>2025</year>
335894+
</date>
335895+
<format>
335896+
<file-format>HTML</file-format>
335897+
<file-format>TEXT</file-format>
335898+
<file-format>PDF</file-format>
335899+
<file-format>XML</file-format>
335900+
</format>
335901+
<page-count>16</page-count>
335902+
<keywords>
335903+
<kw>Segment Routing</kw>
335904+
<kw>BGP-SRTE</kw>
335905+
<kw>SR-TE</kw>
335906+
<kw>BGP SR Policy SAFI</kw>
335907+
</keywords>
335908+
<abstract><p>This document specifies the signaling of additional Segment Routing (SR) Segment Types for SR Policies in BGP using the SR Policy Subsequent Address Family Identifier (SAFI).</p></abstract>
335909+
<draft>draft-ietf-idr-bgp-sr-segtypes-ext-08</draft>
335910+
<current-status>EXPERIMENTAL</current-status>
335911+
<publication-status>EXPERIMENTAL</publication-status>
335912+
<stream>IETF</stream>
335913+
<area>rtg</area>
335914+
<wg_acronym>idr</wg_acronym>
335915+
<doi>10.17487/RFC9831</doi>
335916+
</rfc-entry>
335917+
<rfc-entry>
335918+
<doc-id>RFC9832</doc-id>
335919+
<title>BGP Classful Transport Planes</title>
335920+
<author>
335921+
<name>K. Vairavakkalai</name>
335922+
<title>Editor</title>
335923+
</author>
335924+
<author>
335925+
<name>N. Venkataraman</name>
335926+
<title>Editor</title>
335927+
</author>
335928+
<date>
335929+
<month>September</month>
335930+
<year>2025</year>
335931+
</date>
335932+
<format>
335933+
<file-format>HTML</file-format>
335934+
<file-format>TEXT</file-format>
335935+
<file-format>PDF</file-format>
335936+
<file-format>XML</file-format>
335937+
</format>
335938+
<page-count>67</page-count>
335939+
<keywords>
335940+
<kw>BGP-CT</kw>
335941+
<kw>CT</kw>
335942+
<kw>Intent-Based Routing</kw>
335943+
<kw>BGP Service Mapping</kw>
335944+
</keywords>
335945+
<abstract><p>This document specifies a mechanism referred to as "Intent-Driven Service Mapping". The mechanism uses BGP to express Intent-based association of overlay routes with underlay routes having specific Traffic Engineering (TE) characteristics satisfying a certain Service Level Agreement (SLA). This is achieved by defining new constructs to group underlay routes with sufficiently similar TE characteristics into identifiable classes (called "Transport Classes" or "TCs"), that overlay routes use as an ordered set to resolve reachability (Resolution Schemes) towards service endpoints. These constructs can be used, for example, to realize the "IETF Network Slice" defined in the TEAS Network Slices framework (RFC 9543).</p><p> Additionally, this document specifies protocol procedures for BGP that enable dissemination of service mapping information in a network that may span multiple cooperating administrative domains. These domains may be administered either by the same provider or by closely coordinating providers. A new BGP address family that leverages the procedures described in RFC 4364 ("BGP/MPLS IP Virtual Private Networks (VPNs)") and follows the NLRI encoding described in RFC 8277 ("Using BGP to Bind MPLS Labels to Address Prefixes") is defined to enable each advertised underlay route to be identified by its class. This new address family is called "BGP Classful Transport" (or "BGP CT").</p></abstract>
335946+
<draft>draft-ietf-idr-bgp-ct-39</draft>
335947+
<current-status>EXPERIMENTAL</current-status>
335948+
<publication-status>EXPERIMENTAL</publication-status>
335949+
<stream>IETF</stream>
335950+
<area>rtg</area>
335951+
<wg_acronym>idr</wg_acronym>
335952+
<doi>10.17487/RFC9832</doi>
335953+
</rfc-entry>
335745335954
<rfc-entry>
335746335955
<doc-id>RFC9837</doc-id>
335747335956
<title>The IPv6 VPN Service Destination Option</title>
@@ -335820,6 +336029,54 @@ Protocol (EPP) that allows EPP clients to manage the Time-to-Live
335820336029
<wg_acronym>NON WORKING GROUP</wg_acronym>
335821336030
<doi>10.17487/RFC9839</doi>
335822336031
</rfc-entry>
336032+
<rfc-entry>
336033+
<doc-id>RFC9843</doc-id>
336034+
<title>IGP Flexible Algorithms: Bandwidth, Delay, Metrics, and Constraints</title>
336035+
<author>
336036+
<name>S. Hegde</name>
336037+
</author>
336038+
<author>
336039+
<name>W. Britto</name>
336040+
</author>
336041+
<author>
336042+
<name>R. Shetty</name>
336043+
</author>
336044+
<author>
336045+
<name>B. Decraene</name>
336046+
</author>
336047+
<author>
336048+
<name>P. Psenak</name>
336049+
</author>
336050+
<author>
336051+
<name>T. Li</name>
336052+
</author>
336053+
<date>
336054+
<month>September</month>
336055+
<year>2025</year>
336056+
</date>
336057+
<format>
336058+
<file-format>HTML</file-format>
336059+
<file-format>TEXT</file-format>
336060+
<file-format>PDF</file-format>
336061+
<file-format>XML</file-format>
336062+
</format>
336063+
<page-count>33</page-count>
336064+
<keywords>
336065+
<kw>AS</kw>
336066+
<kw>IGP</kw>
336067+
</keywords>
336068+
<abstract><p>Many networks configure the IGP link metric relative to the link capacity, and high bandwidth traffic gets routed per the link capacity. Flexible Algorithms provide mechanisms to create constraint-based paths in an IGP. This specification documents a generic metric-type and a set of bandwidth-related constraints to be used in Flexible Algorithms.</p><p> This document updates RFC 9350.</p></abstract>
336069+
<draft>draft-ietf-lsr-flex-algo-bw-con-22</draft>
336070+
<updates>
336071+
<doc-id>RFC9350</doc-id>
336072+
</updates>
336073+
<current-status>PROPOSED STANDARD</current-status>
336074+
<publication-status>PROPOSED STANDARD</publication-status>
336075+
<stream>IETF</stream>
336076+
<area>rtg</area>
336077+
<wg_acronym>lsr</wg_acronym>
336078+
<doi>10.17487/RFC9843</doi>
336079+
</rfc-entry>
335823336080
<rfc-entry>
335824336081
<doc-id>RFC9844</doc-id>
335825336082
<title>Entering IPv6 Zone Identifiers in User Interfaces</title>

‎var/rfc-index.xml.etag‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1 +1 @@
1-
W/"e08f79-63e97703832a9-gzip"
1+
W/"e0bd94-63ea323e7db24-gzip"

0 commit comments

Comments
 (0)