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

IETF · RFC · RFC5283

RFC5283 · LDP Extension for Inter-Area Label Switched Paths (LSPs)

LDP Extension for Inter-Area Label Switched Paths (LSPs)

To facilitate the establishment of Label Switched Paths (LSPs) that would span multiple IGP areas in a given Autonomous System (AS), this document describes a new optional Longest-Match Label Mapping Procedure for the Label Distribution Protocol (LDP). This procedure allows the use of a label if the Forwarding Equivalence Class (FEC) Element matches an entry in the Routing Information Base (RIB). Matching is defined by an IP longest-match search and does not mandate an exact match. [STANDARDS-TRACK]

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

To facilitate the establishment of Label Switched Paths (LSPs) that would span multiple IGP areas in a given Autonomous System (AS), this document describes a new optional Longest-Match Label Mapping Procedure for the Label Distribution Protocol (LDP). This procedure allows the use of a label if the Forwarding Equivalence Class (FEC) Element matches an entry in the Routing Information Base (RIB). Matching is defined by an IP longest-match search and does not mandate an exact match. [STANDARDS-TRACK]

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

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

Полные импортированные сведения карточки
{
  "id": "RFC5283",
  "number": 5283,
  "title_en": "LDP Extension for Inter-Area Label Switched Paths (LSPs)",
  "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": "To facilitate the establishment of Label Switched Paths (LSPs) that would span multiple IGP areas in a given Autonomous System (AS), this document describes a new optional Longest-Match Label Mapping Procedure for the Label Distribution Protocol (LDP). This procedure allows the use of a label if the Forwarding Equivalence Class (FEC) Element matches an entry in the Routing Information Base (RIB). Matching is defined by an IP longest-match search and does not mandate an exact match. [STANDARDS-TRACK]",
  "authors": [
    "B. Decraene",
    "JL. Le Roux",
    "I. Minei"
  ],
  "organizations": [],
  "publication_date": "2008-07-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": "mpls",
  "source_draft": "draft-ietf-mpls-ldp-interarea-04",
  "page_count": 12,
  "doi": "10.17487/RFC5283",
  "keywords": [
    "LDP label mapping procedures",
    "longest-match",
    "prefix aggregation"
  ],
  "formats": [
    "TXT",
    "HTML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc5283/",
    "html": "https://www.rfc-editor.org/rfc/rfc5283.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc5283.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc5283/"
  }
}