RFC 9791
Use Cases for MPLS Network Action Indicators and Ancillary Data
RFC 9791: Use Cases for MPLS Network Action Indicators and Ancillary Data β¨
Okay bestie, let's talk about RFC 9791 π. The title is Use Cases for MPLS Network Action Indicators and Ancillary Data, and it's Informational, so it's published for information and isn't a Standards Track spec πΈ. It came out in July 2025 with ISSN 2070-1721. The four authors are T. Saad (Cisco Systems, Inc.), K. Makhijani (Independent), H. Song (Futurewei Technologies), and G. Mirsky (Ericsson) π. The header doesn't list anything it obsoletes or updates, so it stands on its own π¦.
Abstract
This doc shows some use cases that share one thing: they can all be handled by encoding network action indicators and their ancillary data inside MPLS packets π§. The community is really into extending the MPLS data plane to carry that stuff for these cases β¨.
The use cases here aren't a complete list. They're the ones the IETF MPLS, PALS, and DetNet Working Groups actively talked about from the start of MPLS Network Action (MNA) work until this doc was published π .
Status of This Memo
This doc is not an Internet Standards Track specification. It's published for informational purposes π.
It's a product of the Internet Engineering Task Force (IETF), so it reflects IETF community consensus. It got public review and was approved for publication by the Internet Engineering Steering Group (IESG). Not every IESG-approved doc is eligible for any level of Internet Standard, so check Section 2 of RFC 7841 if you're curious π€.
You can find the current status, any errata, and where to send feedback at https://www.rfc-editor.org/info/rfc9791 π₯.
Copyright Notice
Copyright (c) 2025 IETF Trust and the persons identified as the document authors. All rights reserved. π
This doc is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) as they stand on the publication date. Please actually read those, because they spell out your rights and restrictions for this doc π. Code Components pulled out of this doc must include the Revised BSD License text described in Section 4.e of the Trust Legal Provisions, and they come with no warranty, as the Revised BSD License says π«Ά.
Table of Contents
1. Introduction
1.1. Terminology
1.2. Abbreviations
2. Use Cases
2.1. No Further Fast Reroute
2.2. Applicability of Hybrid Measurement Methods
2.2.1. In Situ OAM
2.2.2. Alternate Marking Method
2.3. Network Slicing
2.4. NSH-Based Service Function Chaining
2.5. Network Programming
3. Coexistence with the Existing MPLS Services Using Post-Stack
Headers
4. Coexistence of the MNA Use Cases
5. IANA Considerations
6. Security Considerations
7. References
7.1. Normative References
7.2. Informative References
Appendix A. Use Cases for Continued Discussion
A.1. Generic Delivery Functions
A.2. Delay Budgets for Time-Bound Applications
A.3. Stack-Based Methods for Latency Control
Acknowledgements
Contributors
Authors' Addresses
1. Introduction π
This doc covers use cases that need special handling from the forwarding hardware π₯. Right now, the way to do that is to allocate a brand-new Special-Purpose Label (SPL) [RFC3032] or an Extended Special-Purpose Label (eSPL). The thing is, SPLs are super scarce, and an eSPL costs an extra label stack entry for every network action, which is pricey πΈ. So the MPLS Network Action (MNA) [RFC9613] approach was proposed to extend the MPLS architecture π¦. MNA is meant to support functions that might need extra ancillary data inside MPLS packets. It also gives a way to say that the ancillary data is there and that a specific action has to happen to the packet β¨.
This doc lists a bunch of use cases that could really benefit from the MNA framework [RFC9789]. Building on the general MNA framework gives everyone a shared base for future network actions in the MPLS data plane π.
1.1. Terminology
The following terminology is used in the document:
- RFC 9543 Network Slice: Interpreted as defined in [RFC9543]. This document uses "network slice" interchangeably as a shorter version of the term "RFC 9543 Network Slice". π
- MPLS Ancillary Data (also referred to in this document as "ancillary data"): Data that can be classified as:
- residing within the MPLS label stack (referred to as "in-stack data"), and
- residing after the Bottom of Stack (BoS) (referred to as "post-stack data"). π§
1.2. Abbreviations
- AMM: Alternative Marking Method π
- BoS: Bottom of Stack
- DEX: Direct Export
- eSPL: extended Special-Purpose Label
- FRR: Fast Reroute
- G-ACh: Generic Associated Channel
- HbH: Hop by Hop
- I2E: Ingress to Egress
- IOAM: In situ Operations, Administration, and Maintenance
- LSP: Label Switched Path
- LSR: Label Switching Router
- MNA: MPLS Network Action
- NRP: Network Resource Partition
- NSH: Network Service Header
- PW: Pseudowire
- SPL: Special-Purpose Label
- ToS: Top of Stack πΈ
2. Use Cases π
2.1. No Further Fast Reroute
MPLS Fast Reroute [RFC4090] [RFC5286] [RFC7490] [SR-TI-LFA] is a really useful, widely deployed tool for cutting down packet loss when a link or node fails π.
There are situations where a packet gets rerouted away from a failure by one FRR, and then a second FRR hits that same packet on another node and can cause traffic disruption π.
In that case, the packet hit by multiple FRR events can keep looping between the Label Switching Routers (LSRs) that activated FRR, until its TTL runs out. That can cause link congestion and more packet loss π. To avoid this, packets that FRR has redirected get marked using MNA so that no further FRR processing happens β¨.
2.2. Applicability of Hybrid Measurement Methods
MNA can carry the info needed to collect operational data and measure performance metrics that reflect what the marked packet actually experienced π. Optionally, the operational state and telemetry gathered on the LSR may also be transported using MNA techniques π«Ά.
2.2.1. In Situ OAM
In situ Operations, Administration, and Maintenance (IOAM), defined in [RFC9197] and [RFC9326], might be used to collect operational and telemetry information while a packet travels a particular path through a network domain π€οΈ.
IOAM can run in two modes: Ingress to Egress (I2E) and Hop by Hop (HbH). In I2E mode, only the encapsulating and decapsulating nodes process IOAM data fields. In HbH mode, the encapsulating and decapsulating nodes, plus the intermediate IOAM-capable nodes, all process IOAM data fields π₯. The IOAM data fields, defined in [RFC9197], can be used to figure out the operational state of the network as experienced by the packet carrying the IOAM Header on its trip through the IOAM domain π.
Several IOAM Option-Types have been defined:
- Pre-allocated Trace
- Incremental Trace
- Edge-to-Edge
- Proof-of-Transit
- Direct Export (DEX)
For every IOAM Option-Type except Direct Export (DEX), the collected info rides along in the trigger IOAM packet. With IOAM DEX [RFC9326], the operational state and telemetry get collected according to a specified profile, then exported in a manner and format set by a local policy π€. With IOAM DEX, the user data packet only serves to trigger the IOAM data to be directly exported or aggregated locally, so it doesn't get carried in the IOAM trigger packets π .
2.2.2. Alternate Marking Method
The Alternate Marking Method (AMM), defined in [RFC9341] and [RFC9342]), is an example of a hybrid performance measurement method [RFC7799] that can measure packet loss and packet delay performance metrics in an MPLS network π. [RFC8957] defines the Synonymous Flow Label framework for doing AMM in an MPLS network. MNA is an alternative mechanism that can also support AMM in an MPLS network π¦.
2.3. Network Slicing
An RFC 9543 Network Slice Service [RFC9543] gives you connectivity paired with network resource commitments, and it's described in terms of one or more connectivity constructs π°. Section 5 of [NS-IP-MPLS] defines a Network Resource Partition (NRP) Policy as a policy construct that lets you instantiate the mechanisms behind one or more network slice services π§©. Packets tied to an NRP may carry a marking in their network-layer header to show that association, called an NRP Selector. The NRP Selector maps a packet to its network resources and applies the matching forwarding treatment π.
A router forwarding a packet that belongs to an NRP might have to pick the forwarding action based on the selected next hop(s), and also pick the forwarding treatment (for example, scheduling and drop policy) to enforce based on the associated per-hop behavior π§ .
So in this case, routers forwarding traffic over a physical link shared by multiple NRPs need to figure out which NRP each packet belongs to, so they can enforce the right forwarding actions and treatments π¦.
MNA technologies can signal actions for MPLS packets and carry the data those actions need. For example, MNA can carry the NRP Selector [NS-IP-MPLS] in MPLS packets π.
2.4. NSH-Based Service Function Chaining
[RFC8595] describes how Service Function Chaining can be done in an MPLS network by emulating the Network Service Header (NSH) [RFC8300] using only MPLS label stack entries π.
The approach in [RFC8595] has some limitations, which [SFP-VERIF] talks about. Even so, the approach can benefit from the MNA framework introduced in [RFC9789] π .
MNA can extend the NSH emulation using MPLS labels [RFC8595] to support the functionality of NSH Context Headers, whether they're fixed or variable length. For example, MNA could support Flow ID [RFC9263], which may be used for load-balancing among Service Function Forwarders and/or the Service Functions within the same Service Function Path π.
2.5. Network Programming
In Segment Routing (SR), an ingress node steers a packet through an ordered list of instructions called "segments". Each instruction represents a function to be called at a specific location in the network. A function is defined locally on the node where it runs, and it can be anything from simply moving forward in the segment list to any complex user-defined behavior πͺ.
Network Programming combines SR functions to reach a networking goal that goes beyond plain packet routing π§.
It may be desirable to encode a pointer to a function and its arguments within an MPLS packet transport header π. MNA can be used to encode the FUNC::ARGs, supporting the functional equivalent of FUNC::ARG in Segment Routing over IPv6 as described in [RFC8986] π.
3. Coexistence with the Existing MPLS Services Using Post-Stack Headers β¨
okay so MPLS is already carrying a LOT of stuff today π Layer 3 (L3) connectivity for unicast and multicast L3 services, and Layer 2 (L2) connectivity like unicast PWs, multicast E-Tree, and broadcast Ethernet LAN (E-LAN) L2 services. In all of those, the user's service traffic just rides along as the payload inside the MPLS packets. Main character energy, honestly π
For L2 service traffic, you can put a Control Word (CW) [RFC4385] [RFC5085] right after the MPLS header. It helps tell apart what kind of MPLS payload you're looking at, keeps packets from getting misordered, and allows for fragmentation π§© When the CW is there, the first nibble of the data right after the MPLS BoS is set to 0b0000, which is how you know the PW CW is present.
MPLS can also carry OAM data π (for example over MPLS Generic Associated Channels (G-AChs) [RFC5586]). In that case the first nibble of the data right after the MPLS BoS is set to 0b0001, which says there's a control channel tied to a PW, LSP, or section.
Bit Index Explicit Replication (BIER) [RFC8296] traffic can be encapsulated over MPLS too π BIER picked 0b0101 as the value for the first nibble of the data that shows up right after the BoS for any BIER-encapsulated packet over MPLS.
For PWs, the G-ACh [RFC7212] uses the first four bits of the PW control word to do the initial sorting between data packets and packets belonging to the associated channel, as described in [RFC4385]. Sorting, but make it networking π
MPLS can even be the data plane for Deterministic Networking (DetNet) [RFC8655] π¦ The DetNet sub-layers, forwarding, and service are all realized using the MPLS label stack, the DetNet control word [RFC8964], and the DetNet Associated Channel Header [RFC9546]. Iconic.
The MNA-based solutions for the use cases in this document, plus any proposed in the future, are expected to allow for coexistence and backward compatibility with all existing MPLS services π«Ά Nobody gets left behind!
4. Coexistence of the MNA Use Cases π§
Two or more of the discussed cases can coexist in the same packet π―ββοΈ When that happens, you may need multiple ancillary data (whether in-stack or post-stack ancillary data) sitting in the same MPLS packet. Stacking is a whole vibe.
For example, IOAM can provide essential functions alongside network slicing π° That helps make sure critical network slice Service Level Objectives (SLOs) are being met by the network provider. In this setup, IOAM can collect key performance measurement parameters of a network slice traffic flow while it travels across the transport network. Accountability, bestie π
5. IANA Considerations πΈ
This document has no IANA actions. Quiet, chill, zero registry drama π
6. Security Considerations π
Section 7 of [RFC9789] outlines security considerations for documents that do not specify protocols. The authors have verified that these considerations are fully applicable to this document. Verified means verified, no cap π
In-depth security analysis for each specific use case is beyond the scope of this document. That work will be addressed in future solution documents π It is strongly recommended that those solution documents undergo review by a security expert early in their development, ideally during the Working Group Last Call phase. Get the security people in early, periodt π‘οΈ
7. References π
7.1. Normative References
- [RFC9789] Andersson, L., Bryant, S., Bocci, M., and T. Li, "MPLS Network Actions (MNAs) Framework", RFC 9789, DOI 10.17487/RFC9789, July 2025,
https://www.rfc-editor.org/info/rfc9789.
7.2. Informative References
- [GDF] Zhang, Z., Bonica, R., Kompella, K., and G. Mirsky, "Generic Delivery Functions", Work in Progress, Internet-Draft, draft-zzhang-intarea-generic-delivery-functions-03, 11 July 2022,
https://datatracker.ietf.org/doc/html/draft-zzhang-intarea-generic-delivery-functions-03. - [NS-IP-MPLS] Saad, T., Beeram, V., Dong, J., Halpern, J., and S. Peng, "Realizing Network Slices in IP/MPLS Networks", Work in Progress, Internet-Draft, draft-ietf-teas-ns-ip-mpls-05, 2 March 2025,
https://datatracker.ietf.org/doc/html/draft-ietf-teas-ns-ip-mpls-05. - [RFC3032] Rosen, E., Tappan, D., Fedorkow, G., Rekhter, Y., Farinacci, D., Li, T., and A. Conta, "MPLS Label Stack Encoding", RFC 3032, DOI 10.17487/RFC3032, January 2001,
https://www.rfc-editor.org/info/rfc3032. - [RFC4090] Pan, P., Ed., Swallow, G., Ed., and A. Atlas, Ed., "Fast Reroute Extensions to RSVP-TE for LSP Tunnels", RFC 4090, DOI 10.17487/RFC4090, May 2005,
https://www.rfc-editor.org/info/rfc4090. - [RFC4385] Bryant, S., Swallow, G., Martini, L., and D. McPherson, "Pseudowire Emulation Edge-to-Edge (PWE3) Control Word for Use over an MPLS PSN", RFC 4385, DOI 10.17487/RFC4385, February 2006,
https://www.rfc-editor.org/info/rfc4385. - [RFC5085] Nadeau, T., Ed. and C. Pignataro, Ed., "Pseudowire Virtual Circuit Connectivity Verification (VCCV): A Control Channel for Pseudowires", RFC 5085, DOI 10.17487/RFC5085, December 2007,
https://www.rfc-editor.org/info/rfc5085. - [RFC5286] Atlas, A., Ed. and A. Zinin, Ed., "Basic Specification for IP Fast Reroute: Loop-Free Alternates", RFC 5286, DOI 10.17487/RFC5286, September 2008,
https://www.rfc-editor.org/info/rfc5286. - [RFC5586] Bocci, M., Ed., Vigoureux, M., Ed., and S. Bryant, Ed., "MPLS Generic Associated Channel", RFC 5586, DOI 10.17487/RFC5586, June 2009,
https://www.rfc-editor.org/info/rfc5586. - [RFC7212] Frost, D., Bryant, S., and M. Bocci, "MPLS Generic Associated Channel (G-ACh) Advertisement Protocol", RFC 7212, DOI 10.17487/RFC7212, June 2014,
https://www.rfc-editor.org/info/rfc7212. - [RFC7490] Bryant, S., Filsfils, C., Previdi, S., Shand, M., and N. So, "Remote Loop-Free Alternate (LFA) Fast Reroute (FRR)", RFC 7490, DOI 10.17487/RFC7490, April 2015,
https://www.rfc-editor.org/info/rfc7490. - [RFC7799] Morton, A., "Active and Passive Metrics and Methods (with Hybrid Types In-Between)", RFC 7799, DOI 10.17487/RFC7799, May 2016,
https://www.rfc-editor.org/info/rfc7799. - [RFC8296] Wijnands, IJ., Ed., Rosen, E., Ed., Dolganow, A., Tantsura, J., Aldrin, S., and I. Meilik, "Encapsulation for Bit Index Explicit Replication (BIER) in MPLS and Non-MPLS Networks", RFC 8296, DOI 10.17487/RFC8296, January 2018,
https://www.rfc-editor.org/info/rfc8296. - [RFC8300] Quinn, P., Ed., Elzur, U., Ed., and C. Pignataro, Ed., "Network Service Header (NSH)", RFC 8300, DOI 10.17487/RFC8300, January 2018,
https://www.rfc-editor.org/info/rfc8300. - [RFC8595] Farrel, A., Bryant, S., and J. Drake, "An MPLS-Based Forwarding Plane for Service Function Chaining", RFC 8595, DOI 10.17487/RFC8595, June 2019,
https://www.rfc-editor.org/info/rfc8595. - [RFC8655] Finn, N., Thubert, P., Varga, B., and J. Farkas, "Deterministic Networking Architecture", RFC 8655, DOI 10.17487/RFC8655, October 2019,
https://www.rfc-editor.org/info/rfc8655. - [RFC8957] Bryant, S., Chen, M., Swallow, G., Sivabalan, S., and G. Mirsky, "Synonymous Flow Label Framework", RFC 8957, DOI 10.17487/RFC8957, January 2021,
https://www.rfc-editor.org/info/rfc8957. - [RFC8964] Varga, B., Ed., Farkas, J., Berger, L., Malis, A., Bryant, S., and J. Korhonen, "Deterministic Networking (DetNet) Data Plane: MPLS", RFC 8964, DOI 10.17487/RFC8964, January 2021,
https://www.rfc-editor.org/info/rfc8964. - [RFC8986] Filsfils, C., Ed., Camarillo, P., Ed., Leddy, J., Voyer, D., Matsushima, S., and Z. Li, "Segment Routing over IPv6 (SRv6) Network Programming", RFC 8986, DOI 10.17487/RFC8986, February 2021,
https://www.rfc-editor.org/info/rfc8986. - [RFC9197] Brockners, F., Ed., Bhandari, S., Ed., and T. Mizrahi, Ed., "Data Fields for In Situ Operations, Administration, and Maintenance (IOAM)", RFC 9197, DOI 10.17487/RFC9197, May 2022,
https://www.rfc-editor.org/info/rfc9197. - [RFC9263] Wei, Y., Ed., Elzur, U., Majee, S., Pignataro, C., and D. Eastlake 3rd, "Network Service Header (NSH) Metadata Type 2 Variable-Length Context Headers", RFC 9263, DOI 10.17487/RFC9263, August 2022,
https://www.rfc-editor.org/info/rfc9263. - [RFC9326] Song, H., Gafni, B., Brockners, F., Bhandari, S., and T. Mizrahi, "In Situ Operations, Administration, and Maintenance (IOAM) Direct Exporting", RFC 9326, DOI 10.17487/RFC9326, November 2022,
https://www.rfc-editor.org/info/rfc9326. - [RFC9341] Fioccola, G., Ed., Cociglio, M., Mirsky, G., Mizrahi, T., and T. Zhou, "Alternate-Marking Method", RFC 9341, DOI 10.17487/RFC9341, December 2022,
https://www.rfc-editor.org/info/rfc9341. - [RFC9342] Fioccola, G., Ed., Cociglio, M., Sapio, A., Sisto, R., and T. Zhou, "Clustered Alternate-Marking Method", RFC 9342, DOI 10.17487/RFC9342, December 2022,
https://www.rfc-editor.org/info/rfc9342. - [RFC9543] Farrel, A., Ed., Drake, J., Ed., Rokui, R., Homma, S., Makhijani, K., Contreras, L., and J. Tantsura, "A Framework for Network Slices in Networks Built from IETF Technologies", RFC 9543, DOI 10.17487/RFC9543, March 2024,
https://www.rfc-editor.org/info/rfc9543. - [RFC9546] Mirsky, G., Chen, M., and B. Varga, "Operations, Administration, and Maintenance (OAM) for Deterministic Networking (DetNet) with the MPLS Data Plane", RFC 9546, DOI 10.17487/RFC9546, February 2024,
https://www.rfc-editor.org/info/rfc9546. - [RFC9613] Bocci, M., Ed., Bryant, S., and J. Drake, "Requirements for Solutions that Support MPLS Network Actions (MNAs)", RFC 9613, DOI 10.17487/RFC9613, August 2024,
https://www.rfc-editor.org/info/rfc9613. - [SFP-VERIF] Liu, Y. and G. Mirsky, "MPLS-based Service Function Path(SFP) Consistency Verification", Work in Progress, Internet-Draft, draft-lm-mpls-sfc-path-verification-03, 11 June 2022,
https://datatracker.ietf.org/doc/html/draft-lm-mpls-sfc-path-verification-03. - [SR-TI-LFA] Bashandy, A., Litkowski, S., Filsfils, C., Francois, P., Decraene, B., and D. Voyer, "Topology Independent Fast Reroute using Segment Routing", Work in Progress, Internet-Draft, draft-ietf-rtgwg-segment-routing-ti-lfa-21, 12 February 2025,
https://datatracker.ietf.org/doc/html/draft-ietf-rtgwg-segment-routing-ti-lfa-21. - [SRTSN] Stein, Y(J)., "Segment Routed Time Sensitive Networking", Work in Progress, Internet-Draft, draft-stein-srtsn-01, 29 August 2021,
https://datatracker.ietf.org/doc/html/draft-stein-srtsn-01.
Appendix A. Use Cases for Continued Discussion β¨
Okay bestie, this appendix is where the spec gets a little dreamy. It's a list of use cases where MNA could be a viable solution π¦ The discussion on these is still ongoing at the time this document gets published, so think of them as the "we're still cooking" section π³
A.1. Generic Delivery Functions
Generic Delivery Functions (GDFs), defined in [GDF], are a new mechanism for doing stuff that's kinda like what the IPv6 Extension Headers mechanism does π For example, GDF can handle fragmentation and reassembly in the MPLS network by using the Generic Fragmentation Header π§© MNA can support GDF by putting a GDF header in an MPLS packet, inside the post-stack data block [RFC9789] π And it's not just one: multiple GDF headers can be organized as a list of headers and live in the same MPLS packet. Lowkey iconic π
A.2. Delay Budgets for Time-Bound Applications
Okay so routers do two different jobs with incoming packets. First is forwarding, which is deciding where the packet should go π§ Second is scheduling, which is deciding when the packet should go π°οΈ IEEE-802.1 Time-Sensitive Networking (TSN) and DetNet both give you a bunch of mechanisms for scheduling, and they assume the routers are time-synchronized β° The most effective delay-minimizing mechanisms involve per-flow resource allocation, which is very much a "give each flow its own VIP section" energy π
Segment Routing (SR) is a forwarding paradigm where the forwarding instructions get encoded in the packet, in a stack data structure, instead of being programmed into the routers π§ The SR instructions ride inside the packet as a First-In, First-Out stack, and they dictate the forwarding decisions of each successive router, in order π Segment routing can be used to pick a path that's short enough to offer a bounded end-to-end latency, but it does NOT influence how individual packets get queued at each router along that path π (The word "NOT" there is just me being dramatic, not a spec keyword, lol.)
When this is carried over the MPLS data plane, a solution is required to deliver these packets to their final destination within a given time budget β³ One approach to tackling this in SR over MPLS (SR-MPLS) is described in [SRTSN] πΈ
A.3. Stack-Based Methods for Latency Control
Here's a cute trick: one efficient way to put local deadlines into the headers is a "stack", kinda like the one SR already uses to carry forwarding instructions π₯ The number of deadline values in the stack equals the number of routers the packet needs to cross in the network, and each deadline value matches up with one specific router π― The Top of Stack (ToS) is the first router's deadline, and the MPLS BoS is the last one π«Ά All the local deadlines in the stack are later than or equal to the current time (which every router agrees on) β And the times closer to the ToS are always earlier than or equal to the times closer to the MPLS BoS. Very ordered, very slay π
The ingress router is the one that inserts the deadline stack into the packet headers, and no other router needs to know the requirements of the time-bound flows π So admitting a new flow only means updating the ingress router's information base. Easy peasy π
MPLS LSRs that expose the ToS label can also inspect the associated deadline carried in the packet, whether it's in the MPLS stack as in-stack data or after the BoS as post-stack data π
Acknowledgements
The authors gratefully acknowledge the input of the members of the MPLS Open Design Team π«Ά They also sincerely thank Loa Andersson, Xiao Min, Jie Dong, and Yaron Sheffer for their thoughtful suggestions and help in making the document better. Main character supporting cast energy π
Contributors
Loa Anderssen Bronze Dragon Consulting Email: loa@pi.nu
Authors' Addresses
Tarek Saad Cisco Systems, Inc. Email: tsaad.net@gmail.com
Kiran Makhijani Independent Email: kiran.ietf@gmail.com
Haoyu Song Futurewei Technologies Email: haoyu.song@futurewei.com
Greg Mirsky Ericsson Email: gregimirsky@gmail.com π
π¦ where this page comes from
- ietf: rfc9791 2025-07
- π girlified by claude-haiku-5-5 on : a language model's rewrite of the original, under its terms