⌕ Поиск по атласу

IETF · RFC · RFC9262

RFC9262 · Tree Engineering for Bit Index Explicit Replication (BIER-TE)

Tree Engineering for Bit Index Explicit Replication (BIER-TE)

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. 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).

Официальная английская аннотация

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. 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).

Связи документа

Официальный источник · 2022-10-01

Полные импортированные сведения карточки
{
  "id": "RFC9262",
  "number": 9262,
  "title_en": "Tree Engineering for Bit Index Explicit Replication (BIER-TE)",
  "title_ru": "",
  "summary_ru": "",
  "purpose_ru": "",
  "use_ru": "",
  "full_translation_path": "",
  "full_translation_checked_at": "",
  "full_translation_source_sha256": "",
  "architect_note_ru": "",
  "topics_ru": [],
  "translation_state": "not_prepared",
  "verification_level": "not_prepared",
  "verification_level_ru": "Русская выжимка не подготовлена",
  "verification_note_ru": "",
  "abstract_en": "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. 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).",
  "authors": [
    "T. Eckert",
    "M. Menth",
    "G. Cauchie"
  ],
  "organizations": [],
  "publication_date": "2022-10-01",
  "current_status": "PROPOSED STANDARD",
  "current_status_ru": "Предлагаемый стандарт",
  "publication_status": "PROPOSED STANDARD",
  "publication_status_ru": "Предлагаемый стандарт",
  "lifecycle": "active",
  "lifecycle_ru": "Действующий",
  "stream": "IETF",
  "stream_ru": "IETF",
  "area": "rtg",
  "area_ru": "Маршрутизация",
  "working_group": "bier",
  "source_draft": "draft-ietf-bier-te-arch-13",
  "page_count": 43,
  "doi": "10.17487/RFC9262",
  "keywords": [
    "BIER",
    "BIER-TE",
    "controller",
    "ECMP",
    "forwarding",
    "traffic-engineering",
    "multicast",
    "pseudocode",
    "routing",
    "traffic-steering",
    "tree-steering"
  ],
  "formats": [
    "HTML",
    "TXT",
    "PDF",
    "XML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc9262/",
    "html": "https://www.rfc-editor.org/rfc/rfc9262.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc9262.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc9262/"
  }
}