YANG Data Model for Routing in Fat Trees
RFC 9719, “YANG Data Model for Routing in Fat Trees”, is a Proposed Standard document published in April 2025 by Z. Zhang, Y. Wei, S. Ma, X. Liu, B. Rijsman. The canonical text is published by the RFC Editor.
Abstract
This document defines a YANG data model for the configuration and management of the Routing in Fat Trees (RIFT) Protocol. The model is based on YANG 1.1, which is defined in RFC 7950 and conforms to the Network Management Datastore Architecture (NMDA) as described in RFC 8342.
What “Proposed Standard” means
An entry-level standards-track specification: stable, peer-reviewed and a solid basis for implementation, though it may still evolve before becoming an Internet Standard.
The canonical text of RFC 9719 is hosted at rfc-editor.org. Available in HTML,TXT,PDF,XML.
- RFC 9718 DNSSEC Trust Anchor Publication for the Root Zone
- RFC 9720 RFC Formats and Versions
- RFC 9717 A Routing Architecture for Satellite Networks
- RFC 9721 Extended Mobility Procedures for Ethernet VPN Integrated Routing and Bridging
- RFC 9716 Mechanisms for MPLS Ping and Traceroute Procedures in Inter-Domain Segment Routing Networks
- RFC 9722 Fast Recovery for EVPN Designated Forwarder Election
- RFC 9715 IP Fragmentation Avoidance in DNS over UDP
- RFC 9723 BGP Colored Prefix Routing for Services Based on Segment Routing over IPv6