{
  "draft": "draft-ietf-bier-te-arch-13",
  "doc_id": "RFC9262",
  "title": "Tree Engineering for Bit Index Explicit Replication (BIER-TE)",
  "authors": [
    "T. Eckert, Ed.",
    "M. Menth",
    "G. Cauchie"
  ],
  "format": [
    "XML",
    "TEXT",
    "HTML",
    "PDF"
  ],
  "page_count": "43",
  "pub_status": "PROPOSED STANDARD",
  "status": "PROPOSED STANDARD",
  "source": "Bit Indexed Explicit Replication",
  "abstract": "This memo describes per-packet stateless strict and loose path steered replication and forwarding for \"Bit Index Explicit Replication\" (BIER) packets (RFC 8279); it is called \"Tree Engineering for Bit Index Explicit Replication\" (BIER-TE) and is intended to be used as the path steering mechanism for Traffic Engineering with BIER.\n\n BIER-TE introduces a new semantic for \"bit positions\" (BPs). These BPs indicate adjacencies of the network topology, as opposed to (non-TE) BIER in which BPs indicate \"Bit-Forwarding Egress Routers\" (BFERs). A BIER-TE \"packets BitString\" therefore indicates the edges of the (loop-free) tree across which the packets are forwarded by BIER-TE. BIER-TE can leverage BIER forwarding engines with little changes. Co-existence of BIER and BIER-TE forwarding in the same domain is possible -- for example, by using separate BIER \"subdomains\" (SDs). Except for the optional routed adjacencies, BIER-TE does not require a BIER routing underlay and can therefore operate without depending on a routing protocol such as the \"Interior Gateway Protocol\" (IGP).",
  "pub_date": "October 2022",
  "keywords": [
    "BIER",
    "BIER-TE",
    "controller",
    "ECMP",
    "forwarding",
    "traffic-engineering",
    "multicast",
    "pseudocode",
    "routing",
    "traffic-steering",
    "tree-steering"
  ],
  "obsoletes": [],
  "obsoleted_by": [],
  "updates": [],
  "updated_by": [],
  "see_also": [],
  "doi": "10.17487/RFC9262",
  "errata_url": null
}