{
  "draft": "draft-ietf-rift-kv-tie-structure-and-processing",
  "doc_id": "RFC9992",
  "title": "Routing in Fat Trees (RIFT) Key/Value Topology Information Elements Structure and Processing",
  "authors": [
    "J. Head, Ed.",
    "T. Przygienda"
  ],
  "format": [
    "XML",
    "TEXT",
    "HTML",
    "PDF"
  ],
  "page_count": "12",
  "pub_status": "PROPOSED STANDARD",
  "status": "PROPOSED STANDARD",
  "source": "rift",
  "abstract": "The Routing in Fat Trees (RIFT) protocol allows for key/value pairs to be advertised within Key-Value Topology Information Elements (KV TIEs). The data contained within these KV TIEs can be used for any imaginable purpose.\n\nThis document specifies behavior for the various Key Types (i.e., Well-Known, Organizationally Unique Identifier (OUI), and Experimental) and a method to structure corresponding values. It also defines a Well-Known Key Sub-Type used for testing tie-breaking behavior.",
  "pub_date": "June 2026",
  "keywords": [
    "rift",
    "kv"
  ],
  "obsoletes": [],
  "obsoleted_by": [],
  "updates": [],
  "updated_by": [],
  "see_also": [],
  "doi": "10.17487/RFC9992",
  "errata_url": null
}