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

IETF · RFC · RFC9350

RFC9350 · IGP Flexible Algorithm

IGP Flexible Algorithm

IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path. This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network. This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.

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

IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path. This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network. This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.

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

updated_by: RFC9843, RFC9917

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

Полные импортированные сведения карточки
{
  "id": "RFC9350",
  "number": 9350,
  "title_en": "IGP Flexible Algorithm",
  "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": "IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path. This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network. This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.",
  "authors": [
    "P. Psenak",
    "S. Hegde",
    "C. Filsfils",
    "K. Talaulikar",
    "A. Gulko"
  ],
  "organizations": [],
  "publication_date": "2023-02-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": "lsr",
  "source_draft": "draft-ietf-lsr-flex-algo-26",
  "page_count": 42,
  "doi": "10.17487/RFC9350",
  "keywords": [],
  "formats": [
    "HTML",
    "TXT",
    "PDF",
    "XML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [],
    "updates": [],
    "updated_by": [
      "RFC9843",
      "RFC9917"
    ],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc9350/",
    "html": "https://www.rfc-editor.org/rfc/rfc9350.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc9350.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc9350/"
  }
}